var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\",\"authorFirst\":\"1\",\"nocache\":\"1\",\"fullnames\":\"1\",\"theme\":\"bullets\",\"group0\":\"year\",\"group1\":\"type\",\"owner\":\"{}\",\"filter\":\"tags:(ANIT|approxIT|ITapprox)\",\"jsonp\":\"1\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains, and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Niesen\"],\"firstnames\":[\"U.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on\",\"doi\":\"10.1109/ISIT.2011.6034040\",\"file\":\":papers:nrelay_diamond_isit.pdf\",\"issn\":\"2157-8095\",\"month\":\"July\",\"pages\":\"259-263\",\"tags\":\"conf,approxIT,IT,WiNet\",\"title\":\"The approximate capacity of the Gaussian N-relay diamond network\",\"year\":\"2011\",\"bibtex\":\"@inproceedings{6034040,\\n abstract = {We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains, and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound.},\\n author = {Niesen, U. and Diggavi, S.},\\n booktitle = {Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on},\\n doi = {10.1109/ISIT.2011.6034040},\\n file = {:papers:nrelay_diamond_isit.pdf},\\n issn = {2157-8095},\\n month = {July},\\n pages = {259-263},\\n tags = {conf,approxIT,IT,WiNet},\\n title = {The approximate capacity of the Gaussian N-relay diamond network},\\n type = {4},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Niesen, U.\",\"Diggavi, S.\"],\"key\":\"6034040\",\"id\":\"6034040\",\"bibbaseid\":\"niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as in the high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound. We also present approximation results for the asymmetric Gaussian N-relay diamond network. In particular, we show that bursty amplify-and-forward combined with optimal relay selection achieves a rate within a factor O(log4(N)) of capacity with preconstant in the order notation independent of the channel gains.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Niesen\"],\"firstnames\":[\"U.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.N.\"],\"suffixes\":[]}],\"doi\":\"10.1109/TIT.2012.2219154\",\"issn\":\"0018-9448\",\"journal\":\"Information Theory, IEEE Transactions on\",\"month\":\"Feb\",\"number\":\"2\",\"pages\":\"845-859\",\"tags\":\"journal,WiNet,IT,approxIT\",\"title\":\"The Approximate Capacity of the Gaussian n-Relay Diamond Network\",\"url_arxiv\":\"http://arxiv.org/abs/1008.3813\",\"volume\":\"59\",\"year\":\"2013\",\"bibtex\":\"@article{6304926,\\n abstract = {We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as in the high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound. We also present approximation results for the asymmetric Gaussian N-relay diamond network. In particular, we show that bursty amplify-and-forward combined with optimal relay selection achieves a rate within a factor O(log4(N)) of capacity with preconstant in the order notation independent of the channel gains.},\\n author = {Niesen, U. and Diggavi, S.N.},\\n doi = {10.1109/TIT.2012.2219154},\\n issn = {0018-9448},\\n journal = {Information Theory, IEEE Transactions on},\\n month = {Feb},\\n number = {2},\\n pages = {845-859},\\n tags = {journal,WiNet,IT,approxIT},\\n title = {The Approximate Capacity of the Gaussian n-Relay Diamond Network},\\n type = {2},\\n url_arxiv = {http://arxiv.org/abs/1008.3813},\\n volume = {59},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Niesen, U.\",\"Diggavi, S.\"],\"key\":\"6304926\",\"id\":\"6304926\",\"bibbaseid\":\"niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2013\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/1008.3813\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been demonstrated to approximately achieve (within an additive constant number of bits) the Gaussian relay network capacity, universally, i.e., for arbitrary topologies, channel gains, and SNRs. This was established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we develop structured lattice codes that implement the QMF strategy. The main result of this paper is that such structured lattice codes can approximately achieve the Gaussian relay network capacity universally, again within an additive constant. In addition, we establish a similar result for half-duplex networks, where we demonstrate that one can approximately achieve the capacity using fixed transmit-receive (TX-RX) schedules for the relays with no transmit power optimization across the different TX-RX states of the network.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ozgur\"],\"firstnames\":[\"A\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.N.\"],\"suffixes\":[]}],\"doi\":\"10.1109/TIT.2013.2280167\",\"file\":\":papers:lattice_qmf.pdf\",\"issn\":\"0018-9448\",\"journal\":\"Information Theory, IEEE Transactions on\",\"month\":\"Dec\",\"number\":\"12\",\"pages\":\"8275-8294\",\"tags\":\"journal,approxIT,WiNet,IT,WiNetInfFlow\",\"title\":\"Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes\",\"volume\":\"59\",\"year\":\"2013\",\"bibtex\":\"@article{6587830,\\n abstract = {Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been demonstrated to approximately achieve (within an additive constant number of bits) the Gaussian relay network capacity, universally, i.e., for arbitrary topologies, channel gains, and SNRs. This was established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we develop structured lattice codes that implement the QMF strategy. The main result of this paper is that such structured lattice codes can approximately achieve the Gaussian relay network capacity universally, again within an additive constant. In addition, we establish a similar result for half-duplex networks, where we demonstrate that one can approximately achieve the capacity using fixed transmit-receive (TX-RX) schedules for the relays with no transmit power optimization across the different TX-RX states of the network.},\\n author = {Ozgur, A and Diggavi, S.N.},\\n doi = {10.1109/TIT.2013.2280167},\\n file = {:papers:lattice_qmf.pdf},\\n issn = {0018-9448},\\n journal = {Information Theory, IEEE Transactions on},\\n month = {Dec},\\n number = {12},\\n pages = {8275-8294},\\n tags = {journal,approxIT,WiNet,IT,WiNetInfFlow},\\n title = {Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes},\\n type = {2},\\n volume = {59},\\n year = {2013}\\n}\\n\\n\",\"author_short\":[\"Ozgur, A\",\"Diggavi, S.\"],\"key\":\"6587830\",\"id\":\"6587830\",\"bibbaseid\":\"ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticebasedqmfcodes-2013\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We study parallel two-user interference channels when the interference is bursty and feedback is available from the respective receivers. Presence of interference in each subcarrier is modeled as a memoryless Bernoulli random state. The states across subcarriers are drawn from an arbitrary joint distribution with the same marginal probability for each subcarrier and instantiated independent and identically distributed (i.i.d.) over time. For the linear deterministic setup with symmetric interference in each subcarrier, we give a complete characterization of the capacity region. For the analogous setup with Gaussian noise, we give outer bounds and a tight generalized degrees of freedom characterization. We propose a novel helping mechanism, which enables subcarriers in very strong interference regime to help in recovering interfered signals for subcarriers in strong and weak interference regimes. Depending on the interference and burstiness regime, the inner bounds either employ the proposed helping mechanism to code across subcarriers or treat the subcarriers separately. The outer bounds demonstrate a connection to a subset entropy inequality by Madiman and Tetali.\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Mishra\"],\"suffixes\":[]},{\"firstnames\":[\"I.\"],\"propositions\":[],\"lastnames\":[\"Wang\"],\"suffixes\":[]},{\"firstnames\":[\"S.\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"doi\":\"10.1109/TIT.2017.2697866\",\"issn\":\"1557-9654\",\"journal\":\"IEEE Transactions on Information Theory\",\"keywords\":\"Gaussian noise;probability;radio networks;radiofrequency interference;harnessing bursty interference;multicarrier systems;output feedback;interference channels;respective receivers;memoryless Bernoulli random state;arbitrary joint distribution;probability;symmetric interference;capacity region;Gaussian noise;subset entropy inequality;wireless networks;Receivers;Interference channels;Output feedback;Encoding;Channel models;Niobium;Interference channel;bursty interference;feedback;multicarrier systems\",\"month\":\"July\",\"number\":\"7\",\"pages\":\"4430-4452\",\"tags\":\"journal,IT,ANIT,WNIF\",\"title\":\"Harnessing Bursty Interference in Multicarrier Systems With Output Feedback\",\"volume\":\"63\",\"year\":\"2017\",\"bibtex\":\"@article{7911284,\\n abstract = {We study parallel two-user interference channels when the interference is bursty and feedback is available from the respective receivers. Presence of interference in each subcarrier is modeled as a memoryless Bernoulli random state. The states across subcarriers are drawn from an arbitrary joint distribution with the same marginal probability for each subcarrier and instantiated independent and identically distributed (i.i.d.) over time. For the linear deterministic setup with symmetric interference in each subcarrier, we give a complete characterization of the capacity region. For the analogous setup with Gaussian noise, we give outer bounds and a tight generalized degrees of freedom characterization. We propose a novel helping mechanism, which enables subcarriers in very strong interference regime to help in recovering interfered signals for subcarriers in strong and weak interference regimes. Depending on the interference and burstiness regime, the inner bounds either employ the proposed helping mechanism to code across subcarriers or treat the subcarriers separately. The outer bounds demonstrate a connection to a subset entropy inequality by Madiman and Tetali.},\\n author = {S. {Mishra} and I. {Wang} and S. N. {Diggavi}},\\n doi = {10.1109/TIT.2017.2697866},\\n issn = {1557-9654},\\n journal = {IEEE Transactions on Information Theory},\\n keywords = {Gaussian noise;probability;radio networks;radiofrequency interference;harnessing bursty interference;multicarrier systems;output feedback;interference channels;respective receivers;memoryless Bernoulli random state;arbitrary joint distribution;probability;symmetric interference;capacity region;Gaussian noise;subset entropy inequality;wireless networks;Receivers;Interference channels;Output feedback;Encoding;Channel models;Niobium;Interference channel;bursty interference;feedback;multicarrier systems},\\n month = {July},\\n number = {7},\\n pages = {4430-4452},\\n tags = {journal,IT,ANIT,WNIF},\\n title = {Harnessing Bursty Interference in Multicarrier Systems With Output Feedback},\\n type = {2},\\n volume = {63},\\n year = {2017}\\n}\\n\\n\",\"author_short\":[\"Mishra, S.\",\"Wang, I.\",\"Diggavi, S. N.\"],\"key\":\"7911284\",\"id\":\"7911284\",\"bibbaseid\":\"mishra-wang-diggavi-harnessingburstyinterferenceinmulticarriersystemswithoutputfeedback-2017\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Gaussian noise;probability;radio networks;radiofrequency interference;harnessing bursty interference;multicarrier systems;output feedback;interference channels;respective receivers;memoryless Bernoulli random state;arbitrary joint distribution;probability;symmetric interference;capacity region;Gaussian noise;subset entropy inequality;wireless networks;Receivers;Interference channels;Output feedback;Encoding;Channel models;Niobium;Interference channel;bursty interference;feedback;multicarrier systems\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"This letter initiates the study of energy-efficiency gains provided by caching. We focus on the cache-aided Gaussian interference channel in the low-SNR regime. We propose a strategy that creates content overlaps at the transmitter caches to allow for co-operation between the transmitters. This co-operation yields a beamforming gain, which has to be traded off against a multicasting gain. We evaluate the performance of this strategy and show its approximate optimality in both the single-receiver case and the single-transmitter case.\",\"author\":[{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Hachem\"],\"suffixes\":[]},{\"firstnames\":[\"U.\"],\"propositions\":[],\"lastnames\":[\"Niesen\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"doi\":\"10.1109/LCOMM.2018.2822694\",\"issn\":\"1558-2558\",\"journal\":\"IEEE Communications Letters\",\"keywords\":\"array signal processing;cache storage;channel capacity;energy conservation;Gaussian channels;multicast communication;radio networks;radiofrequency interference;telecommunication power management;wireless channels;energy-efficiency gains;cache-aided Gaussian interference channel;low-SNR regime;transmitter caches;co-operation yields;beamforming gain;multicasting gain;Transmitters;Receivers;Multicast communication;Array signal processing;Libraries;Interference channels;Network coding;wireless networks;content distribution networks\",\"month\":\"July\",\"number\":\"7\",\"pages\":\"1434-1437\",\"tags\":\"journal,CCWN,IT,ANIT,WiNetnew,SCS\",\"title\":\"Energy-Efficiency Gains of Caching for Interference Channels\",\"url_arxiv\":\"https://arxiv.org/abs/1808.00653\",\"volume\":\"22\",\"year\":\"2018\",\"bibtex\":\"@article{8335768,\\n abstract = {This letter initiates the study of energy-efficiency gains provided by caching. We focus on the cache-aided Gaussian interference channel in the low-SNR regime. We propose a strategy that creates content overlaps at the transmitter caches to allow for co-operation between the transmitters. This co-operation yields a beamforming gain, which has to be traded off against a multicasting gain. We evaluate the performance of this strategy and show its approximate optimality in both the single-receiver case and the single-transmitter case.},\\n author = {J. {Hachem} and U. {Niesen} and S. {Diggavi}},\\n doi = {10.1109/LCOMM.2018.2822694},\\n issn = {1558-2558},\\n journal = {IEEE Communications Letters},\\n keywords = {array signal processing;cache storage;channel capacity;energy conservation;Gaussian channels;multicast communication;radio networks;radiofrequency interference;telecommunication power management;wireless channels;energy-efficiency gains;cache-aided Gaussian interference channel;low-SNR regime;transmitter caches;co-operation yields;beamforming gain;multicasting gain;Transmitters;Receivers;Multicast communication;Array signal processing;Libraries;Interference channels;Network coding;wireless networks;content distribution networks},\\n month = {July},\\n number = {7},\\n pages = {1434-1437},\\n tags = {journal,CCWN,IT,ANIT,WiNetnew,SCS},\\n title = {Energy-Efficiency Gains of Caching for Interference Channels},\\n type = {2},\\n url_arxiv = {https://arxiv.org/abs/1808.00653},\\n volume = {22},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Hachem, J.\",\"Niesen, U.\",\"Diggavi, S.\"],\"key\":\"8335768\",\"id\":\"8335768\",\"bibbaseid\":\"hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018\",\"role\":\"author\",\"urls\":{\" arxiv\":\"https://arxiv.org/abs/1808.00653\"},\"keyword\":[\"array signal processing;cache storage;channel capacity;energy conservation;Gaussian channels;multicast communication;radio networks;radiofrequency interference;telecommunication power management;wireless channels;energy-efficiency gains;cache-aided Gaussian interference channel;low-SNR regime;transmitter caches;co-operation yields;beamforming gain;multicasting gain;Transmitters;Receivers;Multicast communication;Array signal processing;Libraries;Interference channels;Network coding;wireless networks;content distribution networks\"],\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We develop a characterization of fading models, which assigns a number called logarithmic Jensen's gap to a given fading model. We show that as a consequence of a finite logarithmic Jensen's gap, an approximate capacity region can be obtained for fast fading interference channels (FF-ICs) for several scenarios. We illustrate three instances where a constant capacity gap can be obtained as a function of the logarithmic Jensen's gap. First, for an FF-IC with neither feedback nor instantaneous channel state information at transmitter (CSIT), if the fading distribution has finite logarithmic Jensen's gap, we show that a rate-splitting scheme based on the average interference-to-noise ratio can achieve its approximate capacity. Second, we show that a similar scheme can achieve the approximate capacity of FF-IC with feedback and delayed CSIT, if the fading distribution has finite logarithmic Jensen's gap. Third, when this condition holds, we show that point-to-point codes can achieve approximate capacity for a class of FF-ICs with feedback. We prove that the logarithmic Jensen's gap is finite for common fading models, including Rayleigh and Nakagami fading, thereby obtaining the approximate capacity region of FF-IC with these fading models.\",\"author\":[{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Sebastian\"],\"suffixes\":[]},{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Karakus\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"doi\":\"10.1109/TCOMM.2018.2864266\",\"issn\":\"1558-0857\",\"journal\":\"IEEE Transactions on Communications\",\"keywords\":\"approximation theory;channel capacity;diversity reception;fading channels;Gaussian channels;MIMO communication;Nakagami channels;radio transmitters;radiofrequency interference;Rayleigh channels;fast fading interference channels;finite logarithmic Jensen's gap;approximate capacity region;FF-IC;constant capacity gap;instantaneous channel state information;fading distribution;common fading models;Rayleigh channels;Receivers;Transmitters;Integrated circuit modeling;Interference;Interference channels;fast fading;capacity region;rate-splitting\",\"month\":\"Dec\",\"number\":\"12\",\"pages\":\"6015-6027\",\"tags\":\"journal,ANIT,WiNetnew,NCWN,WNIF\",\"title\":\"Approximate Capacity of Fast Fading Interference Channels With no Instantaneous CSIT\",\"url_arxiv\":\"https://arxiv.org/abs/1706.03659\",\"volume\":\"66\",\"year\":\"2018\",\"bibtex\":\"@article{8429509,\\n abstract = {We develop a characterization of fading models, which assigns a number called logarithmic Jensen's gap to a given fading model. We show that as a consequence of a finite logarithmic Jensen's gap, an approximate capacity region can be obtained for fast fading interference channels (FF-ICs) for several scenarios. We illustrate three instances where a constant capacity gap can be obtained as a function of the logarithmic Jensen's gap. First, for an FF-IC with neither feedback nor instantaneous channel state information at transmitter (CSIT), if the fading distribution has finite logarithmic Jensen's gap, we show that a rate-splitting scheme based on the average interference-to-noise ratio can achieve its approximate capacity. Second, we show that a similar scheme can achieve the approximate capacity of FF-IC with feedback and delayed CSIT, if the fading distribution has finite logarithmic Jensen's gap. Third, when this condition holds, we show that point-to-point codes can achieve approximate capacity for a class of FF-ICs with feedback. We prove that the logarithmic Jensen's gap is finite for common fading models, including Rayleigh and Nakagami fading, thereby obtaining the approximate capacity region of FF-IC with these fading models.},\\n author = {J. {Sebastian} and C. {Karakus} and S. {Diggavi}},\\n doi = {10.1109/TCOMM.2018.2864266},\\n issn = {1558-0857},\\n journal = {IEEE Transactions on Communications},\\n keywords = {approximation theory;channel capacity;diversity reception;fading channels;Gaussian channels;MIMO communication;Nakagami channels;radio transmitters;radiofrequency interference;Rayleigh channels;fast fading interference channels;finite logarithmic Jensen's gap;approximate capacity region;FF-IC;constant capacity gap;instantaneous channel state information;fading distribution;common fading models;Rayleigh channels;Receivers;Transmitters;Integrated circuit modeling;Interference;Interference channels;fast fading;capacity region;rate-splitting},\\n month = {Dec},\\n number = {12},\\n pages = {6015-6027},\\n tags = {journal,ANIT,WiNetnew,NCWN,WNIF},\\n title = {Approximate Capacity of Fast Fading Interference Channels With no Instantaneous CSIT},\\n type = {2},\\n url_arxiv = {https://arxiv.org/abs/1706.03659},\\n volume = {66},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Sebastian, J.\",\"Karakus, C.\",\"Diggavi, S.\"],\"key\":\"8429509\",\"id\":\"8429509\",\"bibbaseid\":\"sebastian-karakus-diggavi-approximatecapacityoffastfadinginterferencechannelswithnoinstantaneouscsit-2018\",\"role\":\"author\",\"urls\":{\" arxiv\":\"https://arxiv.org/abs/1706.03659\"},\"keyword\":[\"approximation theory;channel capacity;diversity reception;fading channels;Gaussian channels;MIMO communication;Nakagami channels;radio transmitters;radiofrequency interference;Rayleigh channels;fast fading interference channels;finite logarithmic Jensen's gap;approximate capacity region;FF-IC;constant capacity gap;instantaneous channel state information;fading distribution;common fading models;Rayleigh channels;Receivers;Transmitters;Integrated circuit modeling;Interference;Interference channels;fast fading;capacity region;rate-splitting\"],\"metadata\":{\"authorlinks\":{}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We study the generalized degrees of freedom (gDoF) of block-fading noncoherent multiple input multiple output (MIMO) channels with asymmetric distributions of link strengths and a coherence time of T symbol durations. We derive the optimal signaling structure for communication for the asymmetric MIMO channel, which is distinct from that for the MIMO channel with independent and identically distributed (i.i.d.) links. We extend the existing results for the single input multiple output (SIMO) channel with i.i.d. links to the asymmetric case, proving that selecting the statistically best antenna is gDoFoptimal. Using the gDoF result for the SIMO channel, we prove that for T = 1, the gDoF is zero for MIMO channels with arbitrary link strengths. We show that selecting the statistically best antenna is gDoF-optimal for the multiple input single output (MISO) channel. We also derive the gDoF for the 2 x 2 MIMO channel with different exponents in the direct and cross links. In this setting, we show that it is always necessary to use both the antennas to achieve the gDoF, in contrast to the results for the 2 x 2 MIMO channel with i.i.d. links. We show that having weaker crosslinks, gives gDoF gain compared to the case with i.i.d. links. For the noncoherent MIMO channel with i.i.d. links, the traditional method of training each transmit antenna independently is degrees of freedom (DoF) optimal, whereas we observe that for the asymmetric 2 x 2 MIMO channel, the traditional training is not gDoF-optimal. We extend this observation to a larger MxM MIMO channel by demonstrating a strategy that can achieve larger gDoF than a traditional trainingbased method.\",\"author\":[{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Sebastian\"],\"suffixes\":[]},{\"firstnames\":[\"S.\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"doi\":\"10.1109/TIT.2020.2978183\",\"issn\":\"1557-9654\",\"journal\":\"IEEE Transactions on Information Theory\",\"keywords\":\"MIMO communication;MISO communication;SIMO communication;transmitting antennas;generalized degrees freedom;noncoherent MIMO channel;asymmetric link strengths;block-fading noncoherent multiple input multiple output channels;asymmetric distributions;optimal signaling structure;asymmetric MIMO channel;single input multiple output channel;asymmetric case;SIMO channel;arbitrary link strengths;multiple input single output channel;direct links;cross links;gDoF gain;degrees of freedom optimal;MxM MIMO channel;MIMO communication;Signal to noise ratio;Fading channels;Transmitting antennas;Coherence;MISO communication;Degrees of freedom (DoF);multiple antennas;time-varying channels;noncoherent communication\",\"month\":\"July\",\"number\":\"7\",\"pages\":\"4431-4448\",\"tags\":\"journal,IT,ANIT,WiNetnew,NCWN,WNIF\",\"title\":\"Generalized Degrees Freedom of Noncoherent MIMO Channels With Asymmetric Link Strengths\",\"volume\":\"66\",\"year\":\"2020\",\"bibtex\":\"@article{9023963,\\n abstract = {We study the generalized degrees of freedom (gDoF) of block-fading noncoherent multiple input multiple output (MIMO) channels with asymmetric distributions of link strengths and a coherence time of T symbol durations. We derive the optimal signaling structure for communication for the asymmetric MIMO channel, which is distinct from that for the MIMO channel with independent and identically distributed (i.i.d.) links. We extend the existing results for the single input multiple output (SIMO) channel with i.i.d. links to the asymmetric case, proving that selecting the statistically best antenna is gDoFoptimal. Using the gDoF result for the SIMO channel, we prove that for T = 1, the gDoF is zero for MIMO channels with arbitrary link strengths. We show that selecting the statistically best antenna is gDoF-optimal for the multiple input single output (MISO) channel. We also derive the gDoF for the 2 x 2 MIMO channel with different exponents in the direct and cross links. In this setting, we show that it is always necessary to use both the antennas to achieve the gDoF, in contrast to the results for the 2 x 2 MIMO channel with i.i.d. links. We show that having weaker crosslinks, gives gDoF gain compared to the case with i.i.d. links. For the noncoherent MIMO channel with i.i.d. links, the traditional method of training each transmit antenna independently is degrees of freedom (DoF) optimal, whereas we observe that for the asymmetric 2 x 2 MIMO channel, the traditional training is not gDoF-optimal. We extend this observation to a larger MxM MIMO channel by demonstrating a strategy that can achieve larger gDoF than a traditional trainingbased method.},\\n author = {J. {Sebastian} and S. N. {Diggavi}},\\n doi = {10.1109/TIT.2020.2978183},\\n issn = {1557-9654},\\n journal = {IEEE Transactions on Information Theory},\\n keywords = {MIMO communication;MISO communication;SIMO communication;transmitting antennas;generalized degrees freedom;noncoherent MIMO channel;asymmetric link strengths;block-fading noncoherent multiple input multiple output channels;asymmetric distributions;optimal signaling structure;asymmetric MIMO channel;single input multiple output channel;asymmetric case;SIMO channel;arbitrary link strengths;multiple input single output channel;direct links;cross links;gDoF gain;degrees of freedom optimal;MxM MIMO channel;MIMO communication;Signal to noise ratio;Fading channels;Transmitting antennas;Coherence;MISO communication;Degrees of freedom (DoF);multiple antennas;time-varying channels;noncoherent communication},\\n month = {July},\\n number = {7},\\n pages = {4431-4448},\\n tags = {journal,IT,ANIT,WiNetnew,NCWN,WNIF},\\n title = {Generalized Degrees Freedom of Noncoherent MIMO Channels With Asymmetric Link Strengths},\\n type = {2},\\n volume = {66},\\n year = {2020}\\n}\\n\\n\",\"author_short\":[\"Sebastian, J.\",\"Diggavi, S. N.\"],\"key\":\"9023963\",\"id\":\"9023963\",\"bibbaseid\":\"sebastian-diggavi-generalizeddegreesfreedomofnoncoherentmimochannelswithasymmetriclinkstrengths-2020\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"MIMO communication;MISO communication;SIMO communication;transmitting antennas;generalized degrees freedom;noncoherent MIMO channel;asymmetric link strengths;block-fading noncoherent multiple input multiple output channels;asymmetric distributions;optimal signaling structure;asymmetric MIMO channel;single input multiple output channel;asymmetric case;SIMO channel;arbitrary link strengths;multiple input single output channel;direct links;cross links;gDoF gain;degrees of freedom optimal;MxM MIMO channel;MIMO communication;Signal to noise ratio;Fading channels;Transmitting antennas;Coherence;MISO communication;Degrees of freedom (DoF);multiple antennas;time-varying channels;noncoherent communication\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We study the generalized degrees of freedom (gDoF) of the noncoherent diamond (parallel relay) wireless network with asymmetric distributions of link strengths. We use the noncoherent block-fading model introduced by Marzetta and Hochwald, where no channel state information is available at the transmitters or at the receivers and the channels remain constant for a coherence time of T symbol durations. We first derive an upper bound for the capacity of this channel and then derive the optimal structure for the solution of the upper bound optimization problem. Using the optimal structure, we solve the upper bound optimization problem in terms of its gDoF. Using insights from our upper bound signaling solution, we devise an achievability strategy based on a novel scheme that we call train-scale quantize-map-forward (TS-QMF). This scheme uses training in the links from the source to the relays, scaling and quantizing at the relays combined with nontraining-based schemes. We show the optimality of this scheme by comparing it to the upper bound in terms of the gDoF. In noncoherent point-to-point multiple-input-multiple-output (MIMO) channels, where the fading realization is unknown to the transmitter and the receiver, an important tradeoff between communication and channel learning was revealed by Zheng and Tse, by demonstrating that not all the available antennas might be used, as it is suboptimal to learn all their channel parameters. Our results in this paper for the diamond network demonstrate that in certain regimes of relative channel strengths, the gDoF-optimal scheme uses a subnetwork, demonstrating a similar tradeoff between channel learning and communication. In some regimes, it is gDoF-optimal to do relay selection, i.e., use a part of the network. In the other regimes, even when it is essential to use the entire network, it is suboptimal to learn the channel states for all the links in the network, i.e., traditional training-based schemes are suboptimal in these regimes.\",\"author\":[{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Sebastian\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"doi\":\"10.1109/TIT.2020.2983169\",\"issn\":\"1557-9654\",\"journal\":\"IEEE Transactions on Information Theory\",\"keywords\":\"channel capacity;fading channels;learning (artificial intelligence);MIMO communication;optimisation;quantisation (signal);radio receivers;radio transmitters;relay networks (telecommunication);telecommunication computing;noncoherent point-to-point MIMO channel;noncoherent point-to-point multiple-input-multiple-output channel;TS-QMF;bound signaling solution;bound optimization problem;channel capacity;Hochwald;Marzetta;block-fading model;asymmetric distribution;noncoherent diamond wireless network;generalized degrees of freedom;noncoherent diamond network;gDoF-optimal scheme;train-scale quantize-map-forward;channel state information;Signal to noise ratio;Relays;Diamond;MIMO communication;Upper bound;Fading channels;Wireless networks;Noncoherent communication;degrees of freedom (DoF);relay channels;diamond network;time-varying channels\",\"month\":\"Aug\",\"number\":\"8\",\"pages\":\"5228-5260\",\"tags\":\"journal,IT,ANIT,WiNetnew,NCWN,WNIF\",\"title\":\"Generalized Degrees of Freedom of Noncoherent Diamond Networks\",\"url_arxiv\":\"https://arxiv.org/abs/1802.02667\",\"volume\":\"66\",\"year\":\"2020\",\"bibtex\":\"@article{9046857,\\n abstract = {We study the generalized degrees of freedom (gDoF) of the noncoherent diamond (parallel relay) wireless network with asymmetric distributions of link strengths. We use the noncoherent block-fading model introduced by Marzetta and Hochwald, where no channel state information is available at the transmitters or at the receivers and the channels remain constant for a coherence time of T symbol durations. We first derive an upper bound for the capacity of this channel and then derive the optimal structure for the solution of the upper bound optimization problem. Using the optimal structure, we solve the upper bound optimization problem in terms of its gDoF. Using insights from our upper bound signaling solution, we devise an achievability strategy based on a novel scheme that we call train-scale quantize-map-forward (TS-QMF). This scheme uses training in the links from the source to the relays, scaling and quantizing at the relays combined with nontraining-based schemes. We show the optimality of this scheme by comparing it to the upper bound in terms of the gDoF. In noncoherent point-to-point multiple-input-multiple-output (MIMO) channels, where the fading realization is unknown to the transmitter and the receiver, an important tradeoff between communication and channel learning was revealed by Zheng and Tse, by demonstrating that not all the available antennas might be used, as it is suboptimal to learn all their channel parameters. Our results in this paper for the diamond network demonstrate that in certain regimes of relative channel strengths, the gDoF-optimal scheme uses a subnetwork, demonstrating a similar tradeoff between channel learning and communication. In some regimes, it is gDoF-optimal to do relay selection, i.e., use a part of the network. In the other regimes, even when it is essential to use the entire network, it is suboptimal to learn the channel states for all the links in the network, i.e., traditional training-based schemes are suboptimal in these regimes.},\\n author = {J. {Sebastian} and S. {Diggavi}},\\n doi = {10.1109/TIT.2020.2983169},\\n issn = {1557-9654},\\n journal = {IEEE Transactions on Information Theory},\\n keywords = {channel capacity;fading channels;learning (artificial intelligence);MIMO communication;optimisation;quantisation (signal);radio receivers;radio transmitters;relay networks (telecommunication);telecommunication computing;noncoherent point-to-point MIMO channel;noncoherent point-to-point multiple-input-multiple-output channel;TS-QMF;bound signaling solution;bound optimization problem;channel capacity;Hochwald;Marzetta;block-fading model;asymmetric distribution;noncoherent diamond wireless network;generalized degrees of freedom;noncoherent diamond network;gDoF-optimal scheme;train-scale quantize-map-forward;channel state information;Signal to noise ratio;Relays;Diamond;MIMO communication;Upper bound;Fading channels;Wireless networks;Noncoherent communication;degrees of freedom (DoF);relay channels;diamond network;time-varying channels},\\n month = {Aug},\\n number = {8},\\n pages = {5228-5260},\\n tags = {journal,IT,ANIT,WiNetnew,NCWN,WNIF},\\n title = {Generalized Degrees of Freedom of Noncoherent Diamond Networks},\\n type = {2},\\n url_arxiv = {https://arxiv.org/abs/1802.02667},\\n volume = {66},\\n year = {2020}\\n}\\n\\n\",\"author_short\":[\"Sebastian, J.\",\"Diggavi, S.\"],\"key\":\"9046857\",\"id\":\"9046857\",\"bibbaseid\":\"sebastian-diggavi-generalizeddegreesoffreedomofnoncoherentdiamondnetworks-2020\",\"role\":\"author\",\"urls\":{\" arxiv\":\"https://arxiv.org/abs/1802.02667\"},\"keyword\":[\"channel capacity;fading channels;learning (artificial intelligence);MIMO communication;optimisation;quantisation (signal);radio receivers;radio transmitters;relay networks (telecommunication);telecommunication computing;noncoherent point-to-point MIMO channel;noncoherent point-to-point multiple-input-multiple-output channel;TS-QMF;bound signaling solution;bound optimization problem;channel capacity;Hochwald;Marzetta;block-fading model;asymmetric distribution;noncoherent diamond wireless network;generalized degrees of freedom;noncoherent diamond network;gDoF-optimal scheme;train-scale quantize-map-forward;channel state information;Signal to noise ratio;Relays;Diamond;MIMO communication;Upper bound;Fading channels;Wireless networks;Noncoherent communication;degrees of freedom (DoF);relay channels;diamond network;time-varying channels\"],\"metadata\":{\"authorlinks\":{}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Avestimehr\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"D\",\"N\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Tse\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW) Bergen, Norway\",\"month\":\"July\",\"note\":\"\",\"pages\":\"6–11\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow\",\"title\":\"A deterministic model for wireless relay networks and its capacity\",\"year\":\"2007\",\"bibtex\":\"@inproceedings{ADTj07,\\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\\n booktitle = {IEEE Information Theory Workshop (ITW) Bergen, Norway},\\n month = {July},\\n note = {},\\n pages = {6--11},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\\n title = {A deterministic model for wireless relay networks and its capacity},\\n type = {4},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Avestimehr, S.\",\"Diggavi, S N.\",\"Tse, D N C.\"],\"key\":\"ADTj07\",\"id\":\"ADTj07\",\"bibbaseid\":\"avestimehr-diggavi-tse-adeterministicmodelforwirelessrelaynetworksanditscapacity-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Avestimehr\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"D\",\"N\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Tse\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois\",\"label\":\"adt_allerton07a\",\"month\":\"September\",\"note\":\"\",\"pages\":\"\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow\",\"title\":\"Wireless network information flow\",\"year\":\"2007\",\"bibtex\":\"@inproceedings{ADTj07a,\\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\\n label = {adt_allerton07a},\\n month = {September},\\n note = {},\\n pages = {},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\\n title = {Wireless network information flow},\\n type = {4},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Avestimehr, S.\",\"Diggavi, S N.\",\"Tse, D N C.\"],\"key\":\"ADTj07a\",\"id\":\"ADTj07a\",\"bibbaseid\":\"avestimehr-diggavi-tse-wirelessnetworkinformationflow-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Avestimehr\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"D\",\"N\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Tse\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois\",\"label\":\"adt_allerton07b\",\"month\":\"Sept\",\"note\":\"\",\"pages\":\"\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow\",\"title\":\"A Deterministic Approach to Wireless Relay Networks\",\"year\":\"2007\",\"bibtex\":\"@inproceedings{ADTj07b,\\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\\n label = {adt_allerton07b},\\n month = {Sept},\\n note = {},\\n pages = {},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\\n title = {A Deterministic Approach to Wireless Relay Networks},\\n type = {4},\\n year = {2007}\\n}\\n\\n\",\"author_short\":[\"Avestimehr, S.\",\"Diggavi, S N.\",\"Tse, D N C.\"],\"key\":\"ADTj07b\",\"id\":\"ADTj07b\",\"bibbaseid\":\"avestimehr-diggavi-tse-adeterministicapproachtowirelessrelaynetworks-2007\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Avestimehr\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"D\",\"N\",\"C.\",\"Tse\"],\"firstnames\":[\"\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Wireless Communications and Mobile Computing Conference (IWCMC), Crete, Greece\",\"month\":\"August\",\"note\":\"\",\"pages\":\"56–61\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow\",\"title\":\"Approximate characterization of capacity in Gaussian relay networks\",\"year\":\"2008\",\"bibtex\":\"@inproceedings{ADTj08a,\\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse, },\\n booktitle = {IEEE International Wireless Communications and Mobile Computing Conference (IWCMC), Crete, Greece},\\n month = {August},\\n note = {},\\n pages = {56--61},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\\n title = {Approximate characterization of capacity in Gaussian relay networks},\\n type = {4},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Avestimehr, S.\",\"Diggavi, S N.\",\"D N C. Tse, undefined\"],\"key\":\"ADTj08a\",\"id\":\"ADTj08a\",\"bibbaseid\":\"avestimehr-diggavi-dnctse-approximatecharacterizationofcapacityingaussianrelaynetworks-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Avestimehr\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"D\",\"N\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Tse\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT), Toronto, Canada\",\"month\":\"July\",\"note\":\"\",\"pages\":\"474–478\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow\",\"title\":\"Approximate Capacity of Gaussian Relay Networks\",\"year\":\"2008\",\"bibtex\":\"@inproceedings{ADTj08b,\\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Toronto, Canada},\\n month = {July},\\n note = {},\\n pages = {474--478},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\\n title = {Approximate Capacity of Gaussian Relay Networks},\\n type = {4},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Avestimehr, S.\",\"Diggavi, S N.\",\"Tse, D N C.\"],\"key\":\"ADTj08b\",\"id\":\"ADTj08b\",\"bibbaseid\":\"avestimehr-diggavi-tse-approximatecapacityofgaussianrelaynetworks-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Avestimehr\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"D\",\"N\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Tse\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Zurich Seminar on Communications (IZS), Zurich, Switzerland\",\"month\":\"March\",\"note\":\"\",\"pages\":\"92\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow\",\"title\":\"Information flow over compound wireless relay networks\",\"year\":\"2008\",\"bibtex\":\"@inproceedings{ADTj08c,\\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\\n booktitle = {IEEE Zurich Seminar on Communications (IZS), Zurich, Switzerland},\\n month = {March},\\n note = {},\\n pages = {92},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\\n title = {Information flow over compound wireless relay networks},\\n type = {4},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Avestimehr, S.\",\"Diggavi, S N.\",\"Tse, D N C.\"],\"key\":\"ADTj08c\",\"id\":\"ADTj08c\",\"bibbaseid\":\"avestimehr-diggavi-tse-informationflowovercompoundwirelessrelaynetworks-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"This paper approximately resolves the information flow over wireless (Gaussian) relay networks to within a constant number of bits. It introduced the linear deterministic model and established a max-flow min-cut result for linear deterministic networks. The insights from the deterministic approach led to the approximate max-flow min-cut characterization for noisy Gaussian networks, through the introduction of a new relaying strategy called \\\\em quantize-map-forward (QMF).\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Avestimehr\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"D\",\"N\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Tse\"],\"suffixes\":[]}],\"file\":\":papers:wirelessnetinfflow.pdf\",\"journal\":\"IEEE Transactions on Information Theory\",\"label\":\"adtj10\",\"month\":\"April\",\"note\":\"\",\"number\":\"4\",\"pages\":\"\",\"tags\":\"journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow\",\"title\":\"Wireless network information flow: a deterministic approach\",\"url_arxiv\":\"http://arxiv.org/abs/0906.5394\",\"volume\":\"57\",\"year\":\"2011\",\"bibtex\":\"@article{ADTj10,\\n abstract = {This paper approximately resolves the information flow over wireless (Gaussian) relay networks to within a constant number of bits. It introduced the linear deterministic model and established a max-flow min-cut result for linear deterministic networks. The insights from the deterministic approach led to the approximate max-flow min-cut characterization for noisy Gaussian networks, through the introduction of a new relaying\\nstrategy called {\\\\em quantize-map-forward} (QMF).},\\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\\n file = {:papers:wirelessnetinfflow.pdf},\\n journal = {IEEE Transactions on Information Theory},\\n label = {adtj10},\\n month = {April},\\n note = {},\\n number = {4},\\n pages = {},\\n tags = {journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\\n title = {Wireless network information flow: a deterministic approach},\\n type = {2},\\n url_arxiv = {http://arxiv.org/abs/0906.5394},\\n volume = {57},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Avestimehr, S.\",\"Diggavi, S N.\",\"Tse, D N C.\"],\"key\":\"ADTj10\",\"id\":\"ADTj10\",\"bibbaseid\":\"avestimehr-diggavi-tse-wirelessnetworkinformationflowadeterministicapproach-2011\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/0906.5394\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"5\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Avestimehr\"],\"firstnames\":[\"A\",\"Salman\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tian\"],\"firstnames\":[\"Chao\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tse\"],\"firstnames\":[\"David\",\"NC\"],\"suffixes\":[]}],\"journal\":\"Foundations and Trends in Communications and Information Theory\",\"number\":\"1-2\",\"pages\":\"1–183\",\"publisher\":\"Now Publishers Inc. Hanover, MA, USA\",\"tags\":\"monograph,ANIT\",\"title\":\"An approximation approach to network information theory\",\"volume\":\"12\",\"year\":\"2015\",\"bibtex\":\"@article{avestimehr2015approximation,\\n author = {Avestimehr, A Salman and Diggavi, Suhas N and Tian, Chao and Tse, David NC},\\n journal = {Foundations and Trends in Communications and Information Theory},\\n number = {1-2},\\n pages = {1--183},\\n publisher = {Now Publishers Inc. Hanover, MA, USA},\\n tags = {monograph,ANIT},\\n title = {An approximation approach to network information theory},\\n type = {5},\\n volume = {12},\\n year = {2015}\\n}\\n\\n\",\"author_short\":[\"Avestimehr, A S.\",\"Diggavi, S. N\",\"Tian, C.\",\"Tse, D. N.\"],\"key\":\"avestimehr2015approximation\",\"id\":\"avestimehr2015approximation\",\"bibbaseid\":\"avestimehr-diggavi-tian-tse-anapproximationapproachtonetworkinformationtheory-2015\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system's degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hachem\"],\"firstnames\":[\"Jad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Niesen\"],\"firstnames\":[\"Urs\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\",\"N\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Information Theory\",\"number\":\"7\",\"pages\":\"5359–5380\",\"publisher\":\"IEEE\",\"tags\":\"journal,CCWN,IT,WiNetnew,SCS,ANIT\",\"title\":\"Degrees of freedom of cache-aided wireless interference networks\",\"url_arxiv\":\"https://arxiv.org/abs/1606.03175\",\"doi\":\"10.1109/TIT.2018.2825321\",\"volume\":\"64\",\"year\":\"2018\",\"bibtex\":\"@article{hachem2018degrees,\\n abstract = {We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system's degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.},\\n author = {Hachem, Jad and Niesen, Urs and Diggavi, Suhas N},\\n journal = {IEEE Transactions on Information Theory},\\n number = {7},\\n pages = {5359--5380},\\n publisher = {IEEE},\\n tags = {journal,CCWN,IT,WiNetnew,SCS,ANIT},\\n title = {Degrees of freedom of cache-aided wireless interference networks},\\n type = {2},\\n url_arxiv = {https://arxiv.org/abs/1606.03175},\\n doi = {10.1109/TIT.2018.2825321},\\n volume = {64},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Hachem, J.\",\"Niesen, U.\",\"Diggavi, S. N\"],\"key\":\"hachem2018degrees\",\"id\":\"hachem2018degrees\",\"bibbaseid\":\"hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018\",\"role\":\"author\",\"urls\":{\" arxiv\":\"https://arxiv.org/abs/1606.03175\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"3\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hachem\"],\"firstnames\":[\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Niesen\"],\"firstnames\":[\"U.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"S.\"],\"suffixes\":[]}],\"editor\":[{\"propositions\":[],\"lastnames\":[\"Poor\"],\"firstnames\":[\"Vince\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Chen\"],\"firstnames\":[\"Wei\"],\"suffixes\":[]}],\"journal\":\"Edge Caching for Mobile Networks\",\"publisher\":\"Institute of Engineering and Technology (IET) Press\",\"tags\":\"BookChap,CCWN,IT,ANIT,WiNetnew,SCS\",\"title\":\"Caching for Interference Networks: A Separation Architecture\",\"year\":\"2020\",\"bibtex\":\"@article{hachem2020caching,\\n author = {Hachem, J. and Niesen, U. and Diggavi, S.},\\n editor = {Poor, Vince and Chen, Wei},\\n journal = {Edge Caching for Mobile Networks},\\n publisher = {Institute of Engineering and Technology (IET) Press},\\n tags = {BookChap,CCWN,IT,ANIT,WiNetnew,SCS},\\n title = {Caching for Interference Networks: A Separation Architecture},\\n type = {3},\\n year = {2020}\\n}\\n\\n\",\"author_short\":[\"Hachem, J.\",\"Niesen, U.\",\"Diggavi, S.\"],\"editor_short\":[\"Poor, V.\",\"Chen, W.\"],\"key\":\"hachem2020caching\",\"id\":\"hachem2020caching\",\"bibbaseid\":\"hachem-niesen-diggavi-cachingforinterferencenetworksaseparationarchitecture-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"suffixes\":[]},{\"firstnames\":[\"D.\"],\"propositions\":[],\"lastnames\":[\"Tse\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW), Volos, Greece\",\"month\":\"June\",\"note\":\"\",\"pages\":\"331–335\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt\",\"title\":\"Capacity of Deterministic Z-Chain Relay-Interference Network\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{MDFSj09,\\n author = {S. Mohajer and S N. Diggavi and C. Fragouli and D. Tse},\\n booktitle = {IEEE Information Theory Workshop (ITW), Volos, Greece},\\n month = {June},\\n note = {},\\n pages = {331--335},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt},\\n title = {Capacity of Deterministic Z-Chain Relay-Interference Network},\\n type = {4},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Diggavi, S N.\",\"Fragouli, C.\",\"Tse, D.\"],\"key\":\"MDFSj09\",\"id\":\"MDFSj09\",\"bibbaseid\":\"mohajer-diggavi-fragouli-tse-capacityofdeterministiczchainrelayinterferencenetwork-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"suffixes\":[]},{\"firstnames\":[\"D.\"],\"propositions\":[],\"lastnames\":[\"Tse\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois\",\"month\":\"September\",\"note\":\"\",\"pages\":\"464–474\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt\",\"title\":\"Transmission techniques for relay-interference networks\",\"year\":\"2008\",\"bibtex\":\"@inproceedings{MDFTj08,\\n author = {S. Mohajer and S N. Diggavi and C. Fragouli and D. Tse},\\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\\n month = {September},\\n note = {},\\n pages = {464--474},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt},\\n title = {Transmission techniques for relay-interference networks},\\n type = {4},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Diggavi, S N.\",\"Fragouli, C.\",\"Tse, D.\"],\"key\":\"MDFTj08\",\"id\":\"MDFTj08\",\"bibbaseid\":\"mohajer-diggavi-fragouli-tse-transmissiontechniquesforrelayinterferencenetworks-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"In this paper we study two-stage Gaussian relay-interference networks where there are weak cross-links, causing the networks to behave like a chain of Z Gaussian channels. Our main result is an approximate characterization of the capacity region for such networks. We propose a new interference management scheme, termed interference neutralization, which is implemented using structured lattice codes. This scheme allows for over-the-air interference removal, without the transmitters having complete access the interfering signals.\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Fragouli\"],\"suffixes\":[]},{\"firstnames\":[\"D.\"],\"propositions\":[],\"lastnames\":[\"Tse\"],\"suffixes\":[]}],\"file\":\":papers:relayinterference_revised.pdf\",\"journal\":\"IEEE Transactions on Information Theory\",\"label\":\"mdft_js10\",\"month\":\"May\",\"note\":\"\",\"number\":\"5\",\"pages\":\"2837-2864\",\"tags\":\"journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt,LatticeChan\",\"title\":\"Approximate capacity region for a class of relay-interference networks\",\"url_arxiv\":\"http://arxiv.org/abs/1005.0404\",\"volume\":\"57\",\"year\":\"2011\",\"bibtex\":\"@article{MDFTj10,\\n abstract = {In this paper we study  two-stage Gaussian \\nrelay-interference networks where there are weak cross-links, causing the networks to behave like a chain\\nof Z Gaussian channels. Our main result is an approximate characterization of the capacity region for  such networks. We propose a new interference management scheme, termed interference\\nneutralization, which is implemented using structured lattice codes. This scheme allows for over-the-air\\ninterference removal, without the transmitters having complete access the interfering signals.},\\n author = {S. Mohajer and S N. Diggavi and C. Fragouli and D. Tse},\\n file = {:papers:relayinterference_revised.pdf},\\n journal = {IEEE Transactions on Information Theory},\\n label = {mdft_js10},\\n month = {May},\\n note = {},\\n number = {5},\\n pages = {2837-2864},\\n tags = {journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt,LatticeChan},\\n title = {Approximate capacity region for a class of relay-interference networks},\\n type = {2},\\n url_arxiv = {http://arxiv.org/abs/1005.0404},\\n volume = {57},\\n year = {2011}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Diggavi, S N.\",\"Fragouli, C.\",\"Tse, D.\"],\"key\":\"MDFTj10\",\"id\":\"MDFTj10\",\"bibbaseid\":\"mohajer-diggavi-fragouli-tse-approximatecapacityregionforaclassofrelayinterferencenetworks-2011\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/1005.0404\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"D.\"],\"propositions\":[],\"lastnames\":[\"Tse\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Symposium on Information Theory (ISIT), Seoul, Korea\",\"month\":\"June\",\"note\":\"\",\"pages\":\"31–35\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt,LatticeChan\",\"title\":\"Approximate Capacity of a Class of Gaussian Relay-Interference Networks\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{MDTj09,\\n author = {S. Mohajer and S N. Diggavi and D. Tse},\\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Seoul, Korea},\\n month = {June},\\n note = {},\\n pages = {31--35},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt,LatticeChan},\\n title = {Approximate Capacity of a Class of Gaussian Relay-Interference Networks},\\n type = {4},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Diggavi, S N.\",\"Tse, D.\"],\"key\":\"MDTj09\",\"id\":\"MDTj09\",\"bibbaseid\":\"mohajer-diggavi-tse-approximatecapacityofaclassofgaussianrelayinterferencenetworks-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"Lossless transmission of a set of correlated sources over a deterministic relay network is considered for two traffic requirements. In distributed multicast, the set of sources are to be delivered to a set of destinations. The source exchange requires all the nodes with access to sources to be able to reconstruct all other sources observed at other nodes. We develop achievable regions and outer bounds for both these situations. For linear deterministic networks, these bounds coincide, yielding a characterization.\",\"author\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Mohajer\"],\"suffixes\":[]},{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"S.N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"booktitle\":\"IEEE Information Theory Workshop (ITW) Cairo\",\"file\":\":papers:mtd_itw10_final.pdf\",\"month\":\"January\",\"note\":\"\",\"pages\":\"\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SrcChan,SrcChanSep,NDC,InfExch,SelConf\",\"title\":\"On source transmission over deterministic relay networks\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{MTDp10,\\n abstract = {Lossless transmission of a set of correlated sources\\nover a deterministic relay network is considered for two traffic\\nrequirements. In distributed multicast, the set of sources are\\nto be delivered to a set of destinations. The source exchange\\nrequires all the nodes with access to sources to be able to\\nreconstruct all other sources observed at other nodes. We develop\\nachievable regions and outer bounds for both these situations. For\\nlinear deterministic networks, these bounds coincide, yielding a\\ncharacterization.},\\n author = {S. Mohajer and C. Tian and S.N. Diggavi},\\n booktitle = {IEEE Information Theory Workshop (ITW) Cairo},\\n file = {:papers:mtd_itw10_final.pdf},\\n month = {January},\\n note = {},\\n pages = {},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SrcChan,SrcChanSep,NDC,InfExch,SelConf},\\n title = {On source transmission over deterministic relay networks},\\n type = {4},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Mohajer, S.\",\"Tian, C.\",\"Diggavi, S.\"],\"key\":\"MTDp10\",\"id\":\"MTDp10\",\"bibbaseid\":\"mohajer-tian-diggavi-onsourcetransmissionoverdeterministicrelaynetworks-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"An approximate max-flow min-cut result for arbitrary wireless relay network was recently established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we show that the approximation result can be established by using lattices for transmission and quantization along with structured mappings at the relays. This also extended the original scalar quantizer analysis to vector quantizers and obtained a slightly better approximation constant.\",\"author\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Ozgur\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"booktitle\":\"Proc. of IEEE ISIT 2010, Austin, Texas\",\"file\":\":papers:od_isit10.pdf\",\"month\":\"June\",\"note\":\"\",\"pages\":\"669–673\",\"tags\":\"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SelConf,LatticeChan\",\"title\":\"Approximately achieving Gaussian relay network capacity with lattice codes\",\"url_arxiv\":\"http://arxiv.org/abs/1005.1284\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{ODp10,\\n abstract = {An approximate max-flow min-cut result for arbitrary wireless relay\\nnetwork was recently established using Gaussian codebooks for\\ntransmission and random mappings at the relays. In this paper,\\nwe show that the approximation result can be established\\nby using lattices for transmission and quantization along with\\nstructured mappings at the relays. This also extended the original scalar quantizer\\nanalysis to vector quantizers and obtained a slightly better approximation constant.},\\n author = {A. Ozgur and S N. Diggavi},\\n booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},\\n file = {:papers:od_isit10.pdf},\\n month = {June},\\n note = {},\\n pages = {669--673},\\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SelConf,LatticeChan},\\n title = {Approximately achieving Gaussian relay network capacity with lattice codes},\\n type = {4},\\n url_arxiv = {http://arxiv.org/abs/1005.1284},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Ozgur, A.\",\"Diggavi, S N.\"],\"key\":\"ODp10\",\"id\":\"ODp10\",\"bibbaseid\":\"ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticecodes-2010\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/1005.1284\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"This paper studies the idea of noise insertion by authenticated relays through friendly jamming. We develop the secrecy rate achievable in arbitrary (deterministic) networks when there are relays actively helping secrecy.\",\"author\":[{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"Perron\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"E.\",\"Telatar\"],\"firstnames\":[\"\"],\"suffixes\":[]}],\"booktitle\":\"Information Theory and Applications workshop (ITA), UCSD, San Diego, California\",\"file\":\":papers:pdtita09final.pdf\",\"label\":\"pdtc09d\",\"month\":\"February\",\"note\":\"\",\"pages\":\"77–84\",\"tags\":\"conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,ITapprox,WiNet\",\"title\":\"On noise insertion strategies for wireless network secrecy\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{PDTc09d,\\n abstract = {This paper studies the idea of noise insertion by authenticated relays through friendly jamming. We develop the secrecy rate achievable in arbitrary (deterministic) networks when there are relays actively helping secrecy.},\\n author = {E. Perron and S N. Diggavi and E. Telatar,},\\n booktitle = {Information Theory and Applications workshop (ITA), UCSD, San Diego, California},\\n file = {:papers:pdtita09final.pdf},\\n label = {pdtc09d},\\n month = {February},\\n note = {},\\n pages = {77--84},\\n tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,ITapprox,WiNet},\\n title = {On noise insertion strategies for wireless network secrecy},\\n type = {4},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Perron, E.\",\"Diggavi, S N.\",\"E. Telatar, undefined\"],\"key\":\"PDTc09d\",\"id\":\"PDTc09d\",\"bibbaseid\":\"perron-diggavi-etelatar-onnoiseinsertionstrategiesforwirelessnetworksecrecy-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the other receiver is required to decode the messages from both transmitters. We provide an inner bound on the capacity region of this channel, as well as an outer bound for a special class of such channels. For this class, we also quantify the gap between inner and outer bound and show that the bounds match for a semi-deterministic channel, providing a complete characterization. For the Gaussian case, we show that the gap is at most 1 bit, yielding an approximate characterization.\",\"author\":[{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"Perron\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"Telatar\"],\"suffixes\":[]}],\"booktitle\":\"IEEE International Conference on Communications (ICC), Dresden, Germany\",\"file\":\":papers:pdt_icc09.pdf\",\"month\":\"June\",\"note\":\"\",\"pages\":\"31–35\",\"tags\":\"conf,ITapprox,WiNet,IT,WiNetInfFlow,IntChan,SelConf\",\"title\":\"On the interference-multiple-access channel\",\"year\":\"2009\",\"bibtex\":\"@inproceedings{PDTj09c,\\n abstract = {We introduce the interference-multiple-access channel,\\nwhich is a discrete memoryless channel with two transmitters\\nand two receivers, similar to the interference channel. One\\nreceiver is required to decode the information encoded at one\\ntransmitter, the other receiver is required to decode the messages\\nfrom both transmitters. We provide an inner bound on the\\ncapacity region of this channel, as well as an outer bound for a\\nspecial class of such channels. For this class, we also quantify the\\ngap between inner and outer bound and show that the bounds\\nmatch for a semi-deterministic channel, providing a complete\\ncharacterization. For the Gaussian case, we show that the gap is\\nat most 1 bit, yielding an approximate characterization.},\\n author = {E. Perron and S N. Diggavi and E. Telatar},\\n booktitle = {IEEE International Conference on Communications (ICC), Dresden, Germany},\\n file = {:papers:pdt_icc09.pdf},\\n month = {June},\\n note = {},\\n pages = {31--35},\\n tags = {conf,ITapprox,WiNet,IT,WiNetInfFlow,IntChan,SelConf},\\n title = {On the interference-multiple-access channel},\\n type = {4},\\n year = {2009}\\n}\\n\\n\",\"author_short\":[\"Perron, E.\",\"Diggavi, S N.\",\"Telatar, E.\"],\"key\":\"PDTj09c\",\"id\":\"PDTj09c\",\"bibbaseid\":\"perron-diggavi-telatar-ontheinterferencemultipleaccesschannel-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"1\",\"abstract\":\"We study the generalized degrees of freedom (gDoF) of the block-fading noncoherent 2-user interference channel (IC) with a coherence time of T symbol durations and symmetric fading statistics. We demonstrate that a natural training-based scheme, to operate the noncoherent IC, is suboptimal in several regimes. As an alternate scheme, we propose a new noncoherent rate-splitting scheme. We also consider treating interference-as-noise (TIN) scheme and a time division multiplexing (TDM) scheme. We observe that a standard training-based scheme for IC is outperformed by one of these schemes in several regimes: our results demonstrate that for low average interference-to-noise ratio (INR), TIN is best; for high INR, TDM and the noncoherent rate-splitting give better performance. We also study the noncoherent IC with feedback and propose a noncoherent rate-splitting scheme. Again for the feedback case as well, our results demonstrate that a natural training-based scheme can be outperformed by other schemes.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sebastian\"],\"firstnames\":[\"Joyson\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"firstnames\":[\"Suhas\"],\"suffixes\":[]}],\"journal\":\"arXiv preprint arXiv:1812.03579\",\"tags\":\"journalSub,IT,ANIT,WiNetnew,NCWN\",\"title\":\"On the Generalized Degrees of Freedom of Noncoherent Interference Channel\",\"url_arxiv\":\"https://arxiv.org/abs/1812.03579\",\"year\":\"2018\",\"bibtex\":\"@article{sebastian2018generalized,\\n abstract = {We study the generalized degrees of freedom (gDoF) of the block-fading noncoherent 2-user interference channel (IC) with a coherence time of T symbol durations and symmetric fading statistics. We demonstrate that a natural training-based scheme, to operate the noncoherent IC, is suboptimal in several regimes. As an alternate scheme, we propose a new noncoherent rate-splitting scheme. We also consider treating interference-as-noise (TIN) scheme and a time division multiplexing (TDM) scheme. We observe that a standard training-based scheme for IC is outperformed by one of these schemes in several regimes: our results demonstrate that for low average interference-to-noise ratio (INR), TIN is best; for high INR, TDM and the noncoherent rate-splitting give better performance. We also study the noncoherent IC with feedback and propose a noncoherent rate-splitting scheme. Again for the feedback case as well, our results demonstrate that a natural training-based scheme can be outperformed by other schemes.},\\n author = {Sebastian, Joyson and Diggavi, Suhas},\\n journal = {arXiv preprint arXiv:1812.03579},\\n tags = {journalSub,IT,ANIT,WiNetnew,NCWN},\\n title = {On the Generalized Degrees of Freedom of Noncoherent Interference Channel},\\n type = {1},\\n url_arxiv = {https://arxiv.org/abs/1812.03579},\\n year = {2018}\\n}\\n\\n\",\"author_short\":[\"Sebastian, J.\",\"Diggavi, S.\"],\"key\":\"sebastian2018generalized\",\"id\":\"sebastian2018generalized\",\"bibbaseid\":\"sebastian-diggavi-onthegeneralizeddegreesoffreedomofnoncoherentinterferencechannel-2018\",\"role\":\"author\",\"urls\":{\" arxiv\":\"https://arxiv.org/abs/1812.03579\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Chen\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Shamai\"],\"suffixes\":[]}],\"booktitle\":\"Proc. of IEEE ISIT 2010, Austin, Texas\",\"month\":\"June\",\"note\":\"\",\"pages\":\"495–499\",\"tags\":\"conf,SrcChan,ITapprox,NDC,IT\",\"title\":\"Optimality and approximate optimality of source-channel separation in networks\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{TCDSc10a,\\n author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},\\n booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},\\n month = {June},\\n note = {},\\n pages = {495--499},\\n tags = {conf,SrcChan,ITapprox,NDC,IT},\\n title = {Optimality and approximate optimality of source-channel \\nseparation in networks},\\n type = {4},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Chen, J.\",\"Diggavi, S N.\",\"Shamai, S.\"],\"key\":\"TCDSc10a\",\"id\":\"TCDSc10a\",\"bibbaseid\":\"tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"abstract\":\"We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal when the memoryless sources at source nodes are arbitrarily correlated, each of which is to be reconstructed at possibly multiple destinations within certain distortions, and the channels in this network are synchronized, orthogonal and memoryless (i.e., noisy graphs).\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Chen\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Shamai\"],\"suffixes\":[]}],\"booktitle\":\"International Conference on Signal Processing and Communications (SPCOM)\",\"file\":\":papers:tcdsspcom10.pdf\",\"month\":\"June\",\"note\":\"\",\"pages\":\"1–5\",\"tags\":\"conf,SrcChan,ITapprox,NDC,IT,SelConf\",\"title\":\"On source-channel separation in networks\",\"year\":\"2010\",\"bibtex\":\"@inproceedings{TCDSc10b,\\n abstract = {We consider the source-channel separation architecture\\nfor lossy source coding in communication networks. It\\nis shown that the separation approach is optimal when the\\nmemoryless sources at source nodes are arbitrarily correlated,\\neach of which is to be reconstructed at possibly multiple\\ndestinations within certain distortions, and the channels in this\\nnetwork are synchronized, orthogonal and memoryless (i.e., noisy\\ngraphs).},\\n author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},\\n booktitle = {International Conference on Signal Processing and Communications (SPCOM)},\\n file = {:papers:tcdsspcom10.pdf},\\n month = {June},\\n note = {},\\n pages = {1--5},\\n tags = {conf,SrcChan,ITapprox,NDC,IT,SelConf},\\n title = {On source-channel separation in networks},\\n type = {4},\\n year = {2010}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Chen, J.\",\"Diggavi, S N.\",\"Shamai, S.\"],\"key\":\"TCDSc10b\",\"id\":\"TCDSc10b\",\"bibbaseid\":\"tian-chen-diggavi-shamai-onsourcechannelseparationinnetworks-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"publicactions_v1.bib\" href=\"data:text/bibtex;base64,@inproceedings{6034040,
 abstract = {We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains, and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound.},
 author = {Niesen, U. and Diggavi, S.},
 booktitle = {Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on},
 doi = {10.1109/ISIT.2011.6034040},
 file = {:papers:nrelay_diamond_isit.pdf},
 issn = {2157-8095},
 month = {July},
 pages = {259-263},
 tags = {conf,approxIT,IT,WiNet},
 title = {The approximate capacity of the Gaussian N-relay diamond network},
 type = {4},
 year = {2011}
}



@article{6304926,
 abstract = {We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as in the high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound. We also present approximation results for the asymmetric Gaussian N-relay diamond network. In particular, we show that bursty amplify-and-forward combined with optimal relay selection achieves a rate within a factor O(log4(N)) of capacity with preconstant in the order notation independent of the channel gains.},
 author = {Niesen, U. and Diggavi, S.N.},
 doi = {10.1109/TIT.2012.2219154},
 issn = {0018-9448},
 journal = {Information Theory, IEEE Transactions on},
 month = {Feb},
 number = {2},
 pages = {845-859},
 tags = {journal,WiNet,IT,approxIT},
 title = {The Approximate Capacity of the Gaussian n-Relay Diamond Network},
 type = {2},
 url_arxiv = {http://arxiv.org/abs/1008.3813},
 volume = {59},
 year = {2013}
}



@article{6587830,
 abstract = {Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been demonstrated to approximately achieve (within an additive constant number of bits) the Gaussian relay network capacity, universally, i.e., for arbitrary topologies, channel gains, and SNRs. This was established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we develop structured lattice codes that implement the QMF strategy. The main result of this paper is that such structured lattice codes can approximately achieve the Gaussian relay network capacity universally, again within an additive constant. In addition, we establish a similar result for half-duplex networks, where we demonstrate that one can approximately achieve the capacity using fixed transmit-receive (TX-RX) schedules for the relays with no transmit power optimization across the different TX-RX states of the network.},
 author = {Ozgur, A and Diggavi, S.N.},
 doi = {10.1109/TIT.2013.2280167},
 file = {:papers:lattice_qmf.pdf},
 issn = {0018-9448},
 journal = {Information Theory, IEEE Transactions on},
 month = {Dec},
 number = {12},
 pages = {8275-8294},
 tags = {journal,approxIT,WiNet,IT,WiNetInfFlow},
 title = {Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes},
 type = {2},
 volume = {59},
 year = {2013}
}



@article{7911284,
 abstract = {We study parallel two-user interference channels when the interference is bursty and feedback is available from the respective receivers. Presence of interference in each subcarrier is modeled as a memoryless Bernoulli random state. The states across subcarriers are drawn from an arbitrary joint distribution with the same marginal probability for each subcarrier and instantiated independent and identically distributed (i.i.d.) over time. For the linear deterministic setup with symmetric interference in each subcarrier, we give a complete characterization of the capacity region. For the analogous setup with Gaussian noise, we give outer bounds and a tight generalized degrees of freedom characterization. We propose a novel helping mechanism, which enables subcarriers in very strong interference regime to help in recovering interfered signals for subcarriers in strong and weak interference regimes. Depending on the interference and burstiness regime, the inner bounds either employ the proposed helping mechanism to code across subcarriers or treat the subcarriers separately. The outer bounds demonstrate a connection to a subset entropy inequality by Madiman and Tetali.},
 author = {S. {Mishra} and I. {Wang} and S. N. {Diggavi}},
 doi = {10.1109/TIT.2017.2697866},
 issn = {1557-9654},
 journal = {IEEE Transactions on Information Theory},
 keywords = {Gaussian noise;probability;radio networks;radiofrequency interference;harnessing bursty interference;multicarrier systems;output feedback;interference channels;respective receivers;memoryless Bernoulli random state;arbitrary joint distribution;probability;symmetric interference;capacity region;Gaussian noise;subset entropy inequality;wireless networks;Receivers;Interference channels;Output feedback;Encoding;Channel models;Niobium;Interference channel;bursty interference;feedback;multicarrier systems},
 month = {July},
 number = {7},
 pages = {4430-4452},
 tags = {journal,IT,ANIT,WNIF},
 title = {Harnessing Bursty Interference in Multicarrier Systems With Output Feedback},
 type = {2},
 volume = {63},
 year = {2017}
}



@article{8335768,
 abstract = {This letter initiates the study of energy-efficiency gains provided by caching. We focus on the cache-aided Gaussian interference channel in the low-SNR regime. We propose a strategy that creates content overlaps at the transmitter caches to allow for co-operation between the transmitters. This co-operation yields a beamforming gain, which has to be traded off against a multicasting gain. We evaluate the performance of this strategy and show its approximate optimality in both the single-receiver case and the single-transmitter case.},
 author = {J. {Hachem} and U. {Niesen} and S. {Diggavi}},
 doi = {10.1109/LCOMM.2018.2822694},
 issn = {1558-2558},
 journal = {IEEE Communications Letters},
 keywords = {array signal processing;cache storage;channel capacity;energy conservation;Gaussian channels;multicast communication;radio networks;radiofrequency interference;telecommunication power management;wireless channels;energy-efficiency gains;cache-aided Gaussian interference channel;low-SNR regime;transmitter caches;co-operation yields;beamforming gain;multicasting gain;Transmitters;Receivers;Multicast communication;Array signal processing;Libraries;Interference channels;Network coding;wireless networks;content distribution networks},
 month = {July},
 number = {7},
 pages = {1434-1437},
 tags = {journal,CCWN,IT,ANIT,WiNetnew,SCS},
 title = {Energy-Efficiency Gains of Caching for Interference Channels},
 type = {2},
 url_arxiv = {https://arxiv.org/abs/1808.00653},
 volume = {22},
 year = {2018}
}



@article{8429509,
 abstract = {We develop a characterization of fading models, which assigns a number called logarithmic Jensen's gap to a given fading model. We show that as a consequence of a finite logarithmic Jensen's gap, an approximate capacity region can be obtained for fast fading interference channels (FF-ICs) for several scenarios. We illustrate three instances where a constant capacity gap can be obtained as a function of the logarithmic Jensen's gap. First, for an FF-IC with neither feedback nor instantaneous channel state information at transmitter (CSIT), if the fading distribution has finite logarithmic Jensen's gap, we show that a rate-splitting scheme based on the average interference-to-noise ratio can achieve its approximate capacity. Second, we show that a similar scheme can achieve the approximate capacity of FF-IC with feedback and delayed CSIT, if the fading distribution has finite logarithmic Jensen's gap. Third, when this condition holds, we show that point-to-point codes can achieve approximate capacity for a class of FF-ICs with feedback. We prove that the logarithmic Jensen's gap is finite for common fading models, including Rayleigh and Nakagami fading, thereby obtaining the approximate capacity region of FF-IC with these fading models.},
 author = {J. {Sebastian} and C. {Karakus} and S. {Diggavi}},
 doi = {10.1109/TCOMM.2018.2864266},
 issn = {1558-0857},
 journal = {IEEE Transactions on Communications},
 keywords = {approximation theory;channel capacity;diversity reception;fading channels;Gaussian channels;MIMO communication;Nakagami channels;radio transmitters;radiofrequency interference;Rayleigh channels;fast fading interference channels;finite logarithmic Jensen's gap;approximate capacity region;FF-IC;constant capacity gap;instantaneous channel state information;fading distribution;common fading models;Rayleigh channels;Receivers;Transmitters;Integrated circuit modeling;Interference;Interference channels;fast fading;capacity region;rate-splitting},
 month = {Dec},
 number = {12},
 pages = {6015-6027},
 tags = {journal,ANIT,WiNetnew,NCWN,WNIF},
 title = {Approximate Capacity of Fast Fading Interference Channels With no Instantaneous CSIT},
 type = {2},
 url_arxiv = {https://arxiv.org/abs/1706.03659},
 volume = {66},
 year = {2018}
}



@article{9023963,
 abstract = {We study the generalized degrees of freedom (gDoF) of block-fading noncoherent multiple input multiple output (MIMO) channels with asymmetric distributions of link strengths and a coherence time of T symbol durations. We derive the optimal signaling structure for communication for the asymmetric MIMO channel, which is distinct from that for the MIMO channel with independent and identically distributed (i.i.d.) links. We extend the existing results for the single input multiple output (SIMO) channel with i.i.d. links to the asymmetric case, proving that selecting the statistically best antenna is gDoFoptimal. Using the gDoF result for the SIMO channel, we prove that for T = 1, the gDoF is zero for MIMO channels with arbitrary link strengths. We show that selecting the statistically best antenna is gDoF-optimal for the multiple input single output (MISO) channel. We also derive the gDoF for the 2 x 2 MIMO channel with different exponents in the direct and cross links. In this setting, we show that it is always necessary to use both the antennas to achieve the gDoF, in contrast to the results for the 2 x 2 MIMO channel with i.i.d. links. We show that having weaker crosslinks, gives gDoF gain compared to the case with i.i.d. links. For the noncoherent MIMO channel with i.i.d. links, the traditional method of training each transmit antenna independently is degrees of freedom (DoF) optimal, whereas we observe that for the asymmetric 2 x 2 MIMO channel, the traditional training is not gDoF-optimal. We extend this observation to a larger MxM MIMO channel by demonstrating a strategy that can achieve larger gDoF than a traditional trainingbased method.},
 author = {J. {Sebastian} and S. N. {Diggavi}},
 doi = {10.1109/TIT.2020.2978183},
 issn = {1557-9654},
 journal = {IEEE Transactions on Information Theory},
 keywords = {MIMO communication;MISO communication;SIMO communication;transmitting antennas;generalized degrees freedom;noncoherent MIMO channel;asymmetric link strengths;block-fading noncoherent multiple input multiple output channels;asymmetric distributions;optimal signaling structure;asymmetric MIMO channel;single input multiple output channel;asymmetric case;SIMO channel;arbitrary link strengths;multiple input single output channel;direct links;cross links;gDoF gain;degrees of freedom optimal;MxM MIMO channel;MIMO communication;Signal to noise ratio;Fading channels;Transmitting antennas;Coherence;MISO communication;Degrees of freedom (DoF);multiple antennas;time-varying channels;noncoherent communication},
 month = {July},
 number = {7},
 pages = {4431-4448},
 tags = {journal,IT,ANIT,WiNetnew,NCWN,WNIF},
 title = {Generalized Degrees Freedom of Noncoherent MIMO Channels With Asymmetric Link Strengths},
 type = {2},
 volume = {66},
 year = {2020}
}



@article{9046857,
 abstract = {We study the generalized degrees of freedom (gDoF) of the noncoherent diamond (parallel relay) wireless network with asymmetric distributions of link strengths. We use the noncoherent block-fading model introduced by Marzetta and Hochwald, where no channel state information is available at the transmitters or at the receivers and the channels remain constant for a coherence time of T symbol durations. We first derive an upper bound for the capacity of this channel and then derive the optimal structure for the solution of the upper bound optimization problem. Using the optimal structure, we solve the upper bound optimization problem in terms of its gDoF. Using insights from our upper bound signaling solution, we devise an achievability strategy based on a novel scheme that we call train-scale quantize-map-forward (TS-QMF). This scheme uses training in the links from the source to the relays, scaling and quantizing at the relays combined with nontraining-based schemes. We show the optimality of this scheme by comparing it to the upper bound in terms of the gDoF. In noncoherent point-to-point multiple-input-multiple-output (MIMO) channels, where the fading realization is unknown to the transmitter and the receiver, an important tradeoff between communication and channel learning was revealed by Zheng and Tse, by demonstrating that not all the available antennas might be used, as it is suboptimal to learn all their channel parameters. Our results in this paper for the diamond network demonstrate that in certain regimes of relative channel strengths, the gDoF-optimal scheme uses a subnetwork, demonstrating a similar tradeoff between channel learning and communication. In some regimes, it is gDoF-optimal to do relay selection, i.e., use a part of the network. In the other regimes, even when it is essential to use the entire network, it is suboptimal to learn the channel states for all the links in the network, i.e., traditional training-based schemes are suboptimal in these regimes.},
 author = {J. {Sebastian} and S. {Diggavi}},
 doi = {10.1109/TIT.2020.2983169},
 issn = {1557-9654},
 journal = {IEEE Transactions on Information Theory},
 keywords = {channel capacity;fading channels;learning (artificial intelligence);MIMO communication;optimisation;quantisation (signal);radio receivers;radio transmitters;relay networks (telecommunication);telecommunication computing;noncoherent point-to-point MIMO channel;noncoherent point-to-point multiple-input-multiple-output channel;TS-QMF;bound signaling solution;bound optimization problem;channel capacity;Hochwald;Marzetta;block-fading model;asymmetric distribution;noncoherent diamond wireless network;generalized degrees of freedom;noncoherent diamond network;gDoF-optimal scheme;train-scale quantize-map-forward;channel state information;Signal to noise ratio;Relays;Diamond;MIMO communication;Upper bound;Fading channels;Wireless networks;Noncoherent communication;degrees of freedom (DoF);relay channels;diamond network;time-varying channels},
 month = {Aug},
 number = {8},
 pages = {5228-5260},
 tags = {journal,IT,ANIT,WiNetnew,NCWN,WNIF},
 title = {Generalized Degrees of Freedom of Noncoherent Diamond Networks},
 type = {2},
 url_arxiv = {https://arxiv.org/abs/1802.02667},
 volume = {66},
 year = {2020}
}



@inproceedings{ADTj07,
 author = {S. Avestimehr and S N. Diggavi and D N C. Tse},
 booktitle = {IEEE Information Theory Workshop (ITW) Bergen, Norway},
 month = {July},
 note = {},
 pages = {6--11},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},
 title = {A deterministic model for wireless relay networks and its capacity},
 type = {4},
 year = {2007}
}



@inproceedings{ADTj07a,
 author = {S. Avestimehr and S N. Diggavi and D N C. Tse},
 booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},
 label = {adt_allerton07a},
 month = {September},
 note = {},
 pages = {},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},
 title = {Wireless network information flow},
 type = {4},
 year = {2007}
}



@inproceedings{ADTj07b,
 author = {S. Avestimehr and S N. Diggavi and D N C. Tse},
 booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},
 label = {adt_allerton07b},
 month = {Sept},
 note = {},
 pages = {},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},
 title = {A Deterministic Approach to Wireless Relay Networks},
 type = {4},
 year = {2007}
}



@inproceedings{ADTj08a,
 author = {S. Avestimehr and S N. Diggavi and D N C. Tse, },
 booktitle = {IEEE International Wireless Communications and Mobile Computing Conference (IWCMC), Crete, Greece},
 month = {August},
 note = {},
 pages = {56--61},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},
 title = {Approximate characterization of capacity in Gaussian relay networks},
 type = {4},
 year = {2008}
}



@inproceedings{ADTj08b,
 author = {S. Avestimehr and S N. Diggavi and D N C. Tse},
 booktitle = {IEEE International Symposium on Information Theory (ISIT), Toronto, Canada},
 month = {July},
 note = {},
 pages = {474--478},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},
 title = {Approximate Capacity of Gaussian Relay Networks},
 type = {4},
 year = {2008}
}



@inproceedings{ADTj08c,
 author = {S. Avestimehr and S N. Diggavi and D N C. Tse},
 booktitle = {IEEE Zurich Seminar on Communications (IZS), Zurich, Switzerland},
 month = {March},
 note = {},
 pages = {92},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},
 title = {Information flow over compound wireless relay networks},
 type = {4},
 year = {2008}
}



@article{ADTj10,
 abstract = {This paper approximately resolves the information flow over wireless (Gaussian) relay networks to within a constant number of bits. It introduced the linear deterministic model and established a max-flow min-cut result for linear deterministic networks. The insights from the deterministic approach led to the approximate max-flow min-cut characterization for noisy Gaussian networks, through the introduction of a new relaying
strategy called {\em quantize-map-forward} (QMF).},
 author = {S. Avestimehr and S N. Diggavi and D N C. Tse},
 file = {:papers:wirelessnetinfflow.pdf},
 journal = {IEEE Transactions on Information Theory},
 label = {adtj10},
 month = {April},
 note = {},
 number = {4},
 pages = {},
 tags = {journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},
 title = {Wireless network information flow: a deterministic approach},
 type = {2},
 url_arxiv = {http://arxiv.org/abs/0906.5394},
 volume = {57},
 year = {2011}
}



@article{avestimehr2015approximation,
 author = {Avestimehr, A Salman and Diggavi, Suhas N and Tian, Chao and Tse, David NC},
 journal = {Foundations and Trends in Communications and Information Theory},
 number = {1-2},
 pages = {1--183},
 publisher = {Now Publishers Inc. Hanover, MA, USA},
 tags = {monograph,ANIT},
 title = {An approximation approach to network information theory},
 type = {5},
 volume = {12},
 year = {2015}
}



@article{hachem2018degrees,
 abstract = {We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system's degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.},
 author = {Hachem, Jad and Niesen, Urs and Diggavi, Suhas N},
 journal = {IEEE Transactions on Information Theory},
 number = {7},
 pages = {5359--5380},
 publisher = {IEEE},
 tags = {journal,CCWN,IT,WiNetnew,SCS,ANIT},
 title = {Degrees of freedom of cache-aided wireless interference networks},
 type = {2},
 url_arxiv = {https://arxiv.org/abs/1606.03175},
 doi = {10.1109/TIT.2018.2825321},
 volume = {64},
 year = {2018}
}



@article{hachem2020caching,
 author = {Hachem, J. and Niesen, U. and Diggavi, S.},
 editor = {Poor, Vince and Chen, Wei},
 journal = {Edge Caching for Mobile Networks},
 publisher = {Institute of Engineering and Technology (IET) Press},
 tags = {BookChap,CCWN,IT,ANIT,WiNetnew,SCS},
 title = {Caching for Interference Networks: A Separation Architecture},
 type = {3},
 year = {2020}
}



@inproceedings{MDFSj09,
 author = {S. Mohajer and S N. Diggavi and C. Fragouli and D. Tse},
 booktitle = {IEEE Information Theory Workshop (ITW), Volos, Greece},
 month = {June},
 note = {},
 pages = {331--335},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt},
 title = {Capacity of Deterministic Z-Chain Relay-Interference Network},
 type = {4},
 year = {2009}
}



@inproceedings{MDFTj08,
 author = {S. Mohajer and S N. Diggavi and C. Fragouli and D. Tse},
 booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},
 month = {September},
 note = {},
 pages = {464--474},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt},
 title = {Transmission techniques for relay-interference networks},
 type = {4},
 year = {2008}
}



@article{MDFTj10,
 abstract = {In this paper we study  two-stage Gaussian 
relay-interference networks where there are weak cross-links, causing the networks to behave like a chain
of Z Gaussian channels. Our main result is an approximate characterization of the capacity region for  such networks. We propose a new interference management scheme, termed interference
neutralization, which is implemented using structured lattice codes. This scheme allows for over-the-air
interference removal, without the transmitters having complete access the interfering signals.},
 author = {S. Mohajer and S N. Diggavi and C. Fragouli and D. Tse},
 file = {:papers:relayinterference_revised.pdf},
 journal = {IEEE Transactions on Information Theory},
 label = {mdft_js10},
 month = {May},
 note = {},
 number = {5},
 pages = {2837-2864},
 tags = {journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt,LatticeChan},
 title = {Approximate capacity region for a class of relay-interference networks},
 type = {2},
 url_arxiv = {http://arxiv.org/abs/1005.0404},
 volume = {57},
 year = {2011}
}



@inproceedings{MDTj09,
 author = {S. Mohajer and S N. Diggavi and D. Tse},
 booktitle = {IEEE International Symposium on Information Theory (ISIT), Seoul, Korea},
 month = {June},
 note = {},
 pages = {31--35},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt,LatticeChan},
 title = {Approximate Capacity of a Class of Gaussian Relay-Interference Networks},
 type = {4},
 year = {2009}
}



@inproceedings{MTDp10,
 abstract = {Lossless transmission of a set of correlated sources
over a deterministic relay network is considered for two traffic
requirements. In distributed multicast, the set of sources are
to be delivered to a set of destinations. The source exchange
requires all the nodes with access to sources to be able to
reconstruct all other sources observed at other nodes. We develop
achievable regions and outer bounds for both these situations. For
linear deterministic networks, these bounds coincide, yielding a
characterization.},
 author = {S. Mohajer and C. Tian and S.N. Diggavi},
 booktitle = {IEEE Information Theory Workshop (ITW) Cairo},
 file = {:papers:mtd_itw10_final.pdf},
 month = {January},
 note = {},
 pages = {},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SrcChan,SrcChanSep,NDC,InfExch,SelConf},
 title = {On source transmission over deterministic relay networks},
 type = {4},
 year = {2010}
}



@inproceedings{ODp10,
 abstract = {An approximate max-flow min-cut result for arbitrary wireless relay
network was recently established using Gaussian codebooks for
transmission and random mappings at the relays. In this paper,
we show that the approximation result can be established
by using lattices for transmission and quantization along with
structured mappings at the relays. This also extended the original scalar quantizer
analysis to vector quantizers and obtained a slightly better approximation constant.},
 author = {A. Ozgur and S N. Diggavi},
 booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},
 file = {:papers:od_isit10.pdf},
 month = {June},
 note = {},
 pages = {669--673},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SelConf,LatticeChan},
 title = {Approximately achieving Gaussian relay network capacity with lattice codes},
 type = {4},
 url_arxiv = {http://arxiv.org/abs/1005.1284},
 year = {2010}
}



@inproceedings{PDTc09d,
 abstract = {This paper studies the idea of noise insertion by authenticated relays through friendly jamming. We develop the secrecy rate achievable in arbitrary (deterministic) networks when there are relays actively helping secrecy.},
 author = {E. Perron and S N. Diggavi and E. Telatar,},
 booktitle = {Information Theory and Applications workshop (ITA), UCSD, San Diego, California},
 file = {:papers:pdtita09final.pdf},
 label = {pdtc09d},
 month = {February},
 note = {},
 pages = {77--84},
 tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,ITapprox,WiNet},
 title = {On noise insertion strategies for wireless network secrecy},
 type = {4},
 year = {2009}
}



@inproceedings{PDTj09c,
 abstract = {We introduce the interference-multiple-access channel,
which is a discrete memoryless channel with two transmitters
and two receivers, similar to the interference channel. One
receiver is required to decode the information encoded at one
transmitter, the other receiver is required to decode the messages
from both transmitters. We provide an inner bound on the
capacity region of this channel, as well as an outer bound for a
special class of such channels. For this class, we also quantify the
gap between inner and outer bound and show that the bounds
match for a semi-deterministic channel, providing a complete
characterization. For the Gaussian case, we show that the gap is
at most 1 bit, yielding an approximate characterization.},
 author = {E. Perron and S N. Diggavi and E. Telatar},
 booktitle = {IEEE International Conference on Communications (ICC), Dresden, Germany},
 file = {:papers:pdt_icc09.pdf},
 month = {June},
 note = {},
 pages = {31--35},
 tags = {conf,ITapprox,WiNet,IT,WiNetInfFlow,IntChan,SelConf},
 title = {On the interference-multiple-access channel},
 type = {4},
 year = {2009}
}



@article{sebastian2018generalized,
 abstract = {We study the generalized degrees of freedom (gDoF) of the block-fading noncoherent 2-user interference channel (IC) with a coherence time of T symbol durations and symmetric fading statistics. We demonstrate that a natural training-based scheme, to operate the noncoherent IC, is suboptimal in several regimes. As an alternate scheme, we propose a new noncoherent rate-splitting scheme. We also consider treating interference-as-noise (TIN) scheme and a time division multiplexing (TDM) scheme. We observe that a standard training-based scheme for IC is outperformed by one of these schemes in several regimes: our results demonstrate that for low average interference-to-noise ratio (INR), TIN is best; for high INR, TDM and the noncoherent rate-splitting give better performance. We also study the noncoherent IC with feedback and propose a noncoherent rate-splitting scheme. Again for the feedback case as well, our results demonstrate that a natural training-based scheme can be outperformed by other schemes.},
 author = {Sebastian, Joyson and Diggavi, Suhas},
 journal = {arXiv preprint arXiv:1812.03579},
 tags = {journalSub,IT,ANIT,WiNetnew,NCWN},
 title = {On the Generalized Degrees of Freedom of Noncoherent Interference Channel},
 type = {1},
 url_arxiv = {https://arxiv.org/abs/1812.03579},
 year = {2018}
}



@inproceedings{TCDSc10a,
 author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},
 booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},
 month = {June},
 note = {},
 pages = {495--499},
 tags = {conf,SrcChan,ITapprox,NDC,IT},
 title = {Optimality and approximate optimality of source-channel 
separation in networks},
 type = {4},
 year = {2010}
}



@inproceedings{TCDSc10b,
 abstract = {We consider the source-channel separation architecture
for lossy source coding in communication networks. It
is shown that the separation approach is optimal when the
memoryless sources at source nodes are arbitrarily correlated,
each of which is to be reconstructed at possibly multiple
destinations within certain distortions, and the channels in this
network are synchronized, orthogonal and memoryless (i.e., noisy
graphs).},
 author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},
 booktitle = {International Conference on Signal Processing and Communications (SPCOM)},
 file = {:papers:tcdsspcom10.pdf},
 month = {June},
 note = {},
 pages = {1--5},
 tags = {conf,SrcChan,ITapprox,NDC,IT,SelConf},
 title = {On source-channel separation in networks},
 type = {4},
 year = {2010}
}

\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:(ANIT|approxIT|ITapprox)&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:(ANIT|approxIT|ITapprox)&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=tags:(ANIT|approxIT|ITapprox)&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"sebastian-diggavi-generalizeddegreesfreedomofnoncoherentmimochannelswithasymmetriclinkstrengths-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. Sebastian;  and  S. N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Generalized Degrees Freedom of Noncoherent MIMO Channels With Asymmetric Link Strengths.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 66(7): 4431-4448. July 2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2020.2978183\"\n     onclick=\"log_download('sebastian-diggavi-generalizeddegreesfreedomofnoncoherentmimochannelswithasymmetriclinkstrengths-2020', 'http://doi.org/10.1109/TIT.2020.2978183', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sebastian-diggavi-generalizeddegreesfreedomofnoncoherentmimochannelswithasymmetriclinkstrengths-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sebastian-diggavi-generalizeddegreesfreedomofnoncoherentmimochannelswithasymmetriclinkstrengths-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{9023963,\n abstract = {We study the generalized degrees of freedom (gDoF) of block-fading noncoherent multiple input multiple output (MIMO) channels with asymmetric distributions of link strengths and a coherence time of T symbol durations. We derive the optimal signaling structure for communication for the asymmetric MIMO channel, which is distinct from that for the MIMO channel with independent and identically distributed (i.i.d.) links. We extend the existing results for the single input multiple output (SIMO) channel with i.i.d. links to the asymmetric case, proving that selecting the statistically best antenna is gDoFoptimal. Using the gDoF result for the SIMO channel, we prove that for T = 1, the gDoF is zero for MIMO channels with arbitrary link strengths. We show that selecting the statistically best antenna is gDoF-optimal for the multiple input single output (MISO) channel. We also derive the gDoF for the 2 x 2 MIMO channel with different exponents in the direct and cross links. In this setting, we show that it is always necessary to use both the antennas to achieve the gDoF, in contrast to the results for the 2 x 2 MIMO channel with i.i.d. links. We show that having weaker crosslinks, gives gDoF gain compared to the case with i.i.d. links. For the noncoherent MIMO channel with i.i.d. links, the traditional method of training each transmit antenna independently is degrees of freedom (DoF) optimal, whereas we observe that for the asymmetric 2 x 2 MIMO channel, the traditional training is not gDoF-optimal. We extend this observation to a larger MxM MIMO channel by demonstrating a strategy that can achieve larger gDoF than a traditional trainingbased method.},\n author = {J. {Sebastian} and S. N. {Diggavi}},\n doi = {10.1109/TIT.2020.2978183},\n issn = {1557-9654},\n journal = {IEEE Transactions on Information Theory},\n keywords = {MIMO communication;MISO communication;SIMO communication;transmitting antennas;generalized degrees freedom;noncoherent MIMO channel;asymmetric link strengths;block-fading noncoherent multiple input multiple output channels;asymmetric distributions;optimal signaling structure;asymmetric MIMO channel;single input multiple output channel;asymmetric case;SIMO channel;arbitrary link strengths;multiple input single output channel;direct links;cross links;gDoF gain;degrees of freedom optimal;MxM MIMO channel;MIMO communication;Signal to noise ratio;Fading channels;Transmitting antennas;Coherence;MISO communication;Degrees of freedom (DoF);multiple antennas;time-varying channels;noncoherent communication},\n month = {July},\n number = {7},\n pages = {4431-4448},\n tags = {journal,IT,ANIT,WiNetnew,NCWN,WNIF},\n title = {Generalized Degrees Freedom of Noncoherent MIMO Channels With Asymmetric Link Strengths},\n type = {2},\n volume = {66},\n year = {2020}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study the generalized degrees of freedom (gDoF) of block-fading noncoherent multiple input multiple output (MIMO) channels with asymmetric distributions of link strengths and a coherence time of T symbol durations. We derive the optimal signaling structure for communication for the asymmetric MIMO channel, which is distinct from that for the MIMO channel with independent and identically distributed (i.i.d.) links. We extend the existing results for the single input multiple output (SIMO) channel with i.i.d. links to the asymmetric case, proving that selecting the statistically best antenna is gDoFoptimal. Using the gDoF result for the SIMO channel, we prove that for T = 1, the gDoF is zero for MIMO channels with arbitrary link strengths. We show that selecting the statistically best antenna is gDoF-optimal for the multiple input single output (MISO) channel. We also derive the gDoF for the 2 x 2 MIMO channel with different exponents in the direct and cross links. In this setting, we show that it is always necessary to use both the antennas to achieve the gDoF, in contrast to the results for the 2 x 2 MIMO channel with i.i.d. links. We show that having weaker crosslinks, gives gDoF gain compared to the case with i.i.d. links. For the noncoherent MIMO channel with i.i.d. links, the traditional method of training each transmit antenna independently is degrees of freedom (DoF) optimal, whereas we observe that for the asymmetric 2 x 2 MIMO channel, the traditional training is not gDoF-optimal. We extend this observation to a larger MxM MIMO channel by demonstrating a strategy that can achieve larger gDoF than a traditional trainingbased method.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sebastian-diggavi-generalizeddegreesoffreedomofnoncoherentdiamondnetworks-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. Sebastian;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1802.02667\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sebastian-diggavi-generalizeddegreesoffreedomofnoncoherentdiamondnetworks-2020', 'https://arxiv.org/abs/1802.02667', event);\">\n    Generalized Degrees of Freedom of Noncoherent Diamond Networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 66(8): 5228-5260. Aug 2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1802.02667\"\n     onclick=\"log_download('sebastian-diggavi-generalizeddegreesoffreedomofnoncoherentdiamondnetworks-2020', 'https://arxiv.org/abs/1802.02667', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Generalized Degrees of Freedom of Noncoherent Diamond Networks [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2020.2983169\"\n     onclick=\"log_download('sebastian-diggavi-generalizeddegreesoffreedomofnoncoherentdiamondnetworks-2020', 'http://doi.org/10.1109/TIT.2020.2983169', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sebastian-diggavi-generalizeddegreesoffreedomofnoncoherentdiamondnetworks-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sebastian-diggavi-generalizeddegreesoffreedomofnoncoherentdiamondnetworks-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{9046857,\n abstract = {We study the generalized degrees of freedom (gDoF) of the noncoherent diamond (parallel relay) wireless network with asymmetric distributions of link strengths. We use the noncoherent block-fading model introduced by Marzetta and Hochwald, where no channel state information is available at the transmitters or at the receivers and the channels remain constant for a coherence time of T symbol durations. We first derive an upper bound for the capacity of this channel and then derive the optimal structure for the solution of the upper bound optimization problem. Using the optimal structure, we solve the upper bound optimization problem in terms of its gDoF. Using insights from our upper bound signaling solution, we devise an achievability strategy based on a novel scheme that we call train-scale quantize-map-forward (TS-QMF). This scheme uses training in the links from the source to the relays, scaling and quantizing at the relays combined with nontraining-based schemes. We show the optimality of this scheme by comparing it to the upper bound in terms of the gDoF. In noncoherent point-to-point multiple-input-multiple-output (MIMO) channels, where the fading realization is unknown to the transmitter and the receiver, an important tradeoff between communication and channel learning was revealed by Zheng and Tse, by demonstrating that not all the available antennas might be used, as it is suboptimal to learn all their channel parameters. Our results in this paper for the diamond network demonstrate that in certain regimes of relative channel strengths, the gDoF-optimal scheme uses a subnetwork, demonstrating a similar tradeoff between channel learning and communication. In some regimes, it is gDoF-optimal to do relay selection, i.e., use a part of the network. In the other regimes, even when it is essential to use the entire network, it is suboptimal to learn the channel states for all the links in the network, i.e., traditional training-based schemes are suboptimal in these regimes.},\n author = {J. {Sebastian} and S. {Diggavi}},\n doi = {10.1109/TIT.2020.2983169},\n issn = {1557-9654},\n journal = {IEEE Transactions on Information Theory},\n keywords = {channel capacity;fading channels;learning (artificial intelligence);MIMO communication;optimisation;quantisation (signal);radio receivers;radio transmitters;relay networks (telecommunication);telecommunication computing;noncoherent point-to-point MIMO channel;noncoherent point-to-point multiple-input-multiple-output channel;TS-QMF;bound signaling solution;bound optimization problem;channel capacity;Hochwald;Marzetta;block-fading model;asymmetric distribution;noncoherent diamond wireless network;generalized degrees of freedom;noncoherent diamond network;gDoF-optimal scheme;train-scale quantize-map-forward;channel state information;Signal to noise ratio;Relays;Diamond;MIMO communication;Upper bound;Fading channels;Wireless networks;Noncoherent communication;degrees of freedom (DoF);relay channels;diamond network;time-varying channels},\n month = {Aug},\n number = {8},\n pages = {5228-5260},\n tags = {journal,IT,ANIT,WiNetnew,NCWN,WNIF},\n title = {Generalized Degrees of Freedom of Noncoherent Diamond Networks},\n type = {2},\n url_arxiv = {https://arxiv.org/abs/1802.02667},\n volume = {66},\n year = {2020}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study the generalized degrees of freedom (gDoF) of the noncoherent diamond (parallel relay) wireless network with asymmetric distributions of link strengths. We use the noncoherent block-fading model introduced by Marzetta and Hochwald, where no channel state information is available at the transmitters or at the receivers and the channels remain constant for a coherence time of T symbol durations. We first derive an upper bound for the capacity of this channel and then derive the optimal structure for the solution of the upper bound optimization problem. Using the optimal structure, we solve the upper bound optimization problem in terms of its gDoF. Using insights from our upper bound signaling solution, we devise an achievability strategy based on a novel scheme that we call train-scale quantize-map-forward (TS-QMF). This scheme uses training in the links from the source to the relays, scaling and quantizing at the relays combined with nontraining-based schemes. We show the optimality of this scheme by comparing it to the upper bound in terms of the gDoF. In noncoherent point-to-point multiple-input-multiple-output (MIMO) channels, where the fading realization is unknown to the transmitter and the receiver, an important tradeoff between communication and channel learning was revealed by Zheng and Tse, by demonstrating that not all the available antennas might be used, as it is suboptimal to learn all their channel parameters. Our results in this paper for the diamond network demonstrate that in certain regimes of relative channel strengths, the gDoF-optimal scheme uses a subnetwork, demonstrating a similar tradeoff between channel learning and communication. In some regimes, it is gDoF-optimal to do relay selection, i.e., use a part of the network. In the other regimes, even when it is essential to use the entire network, it is suboptimal to learn the channel states for all the links in the network, i.e., traditional training-based schemes are suboptimal in these regimes.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_3\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_3')\"\n      onkeypress=\"toggleGroup('group_3')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>3</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hachem-niesen-diggavi-cachingforinterferencenetworksaseparationarchitecture-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. Hachem;  U. Niesen;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Caching for Interference Networks: A Separation Architecture.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Edge Caching for Mobile Networks</i>.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hachem-niesen-diggavi-cachingforinterferencenetworksaseparationarchitecture-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hachem-niesen-diggavi-cachingforinterferencenetworksaseparationarchitecture-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hachem2020caching,\n author = {Hachem, J. and Niesen, U. and Diggavi, S.},\n editor = {Poor, Vince and Chen, Wei},\n journal = {Edge Caching for Mobile Networks},\n publisher = {Institute of Engineering and Technology (IET) Press},\n tags = {BookChap,CCWN,IT,ANIT,WiNetnew,SCS},\n title = {Caching for Interference Networks: A Separation Architecture},\n type = {3},\n year = {2020}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_1\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1')\"\n      onkeypress=\"toggleGroup('group_1')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"sebastian-diggavi-onthegeneralizeddegreesoffreedomofnoncoherentinterferencechannel-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Joyson Sebastian;  and  Suhas Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1812.03579\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sebastian-diggavi-onthegeneralizeddegreesoffreedomofnoncoherentinterferencechannel-2018', 'https://arxiv.org/abs/1812.03579', event);\">\n    On the Generalized Degrees of Freedom of Noncoherent Interference Channel.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>arXiv preprint arXiv:1812.03579</i>.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1812.03579\"\n     onclick=\"log_download('sebastian-diggavi-onthegeneralizeddegreesoffreedomofnoncoherentinterferencechannel-2018', 'https://arxiv.org/abs/1812.03579', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"On the Generalized Degrees of Freedom of Noncoherent Interference Channel [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sebastian-diggavi-onthegeneralizeddegreesoffreedomofnoncoherentinterferencechannel-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sebastian-diggavi-onthegeneralizeddegreesoffreedomofnoncoherentinterferencechannel-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{sebastian2018generalized,\n abstract = {We study the generalized degrees of freedom (gDoF) of the block-fading noncoherent 2-user interference channel (IC) with a coherence time of T symbol durations and symmetric fading statistics. We demonstrate that a natural training-based scheme, to operate the noncoherent IC, is suboptimal in several regimes. As an alternate scheme, we propose a new noncoherent rate-splitting scheme. We also consider treating interference-as-noise (TIN) scheme and a time division multiplexing (TDM) scheme. We observe that a standard training-based scheme for IC is outperformed by one of these schemes in several regimes: our results demonstrate that for low average interference-to-noise ratio (INR), TIN is best; for high INR, TDM and the noncoherent rate-splitting give better performance. We also study the noncoherent IC with feedback and propose a noncoherent rate-splitting scheme. Again for the feedback case as well, our results demonstrate that a natural training-based scheme can be outperformed by other schemes.},\n author = {Sebastian, Joyson and Diggavi, Suhas},\n journal = {arXiv preprint arXiv:1812.03579},\n tags = {journalSub,IT,ANIT,WiNetnew,NCWN},\n title = {On the Generalized Degrees of Freedom of Noncoherent Interference Channel},\n type = {1},\n url_arxiv = {https://arxiv.org/abs/1812.03579},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study the generalized degrees of freedom (gDoF) of the block-fading noncoherent 2-user interference channel (IC) with a coherence time of T symbol durations and symmetric fading statistics. We demonstrate that a natural training-based scheme, to operate the noncoherent IC, is suboptimal in several regimes. As an alternate scheme, we propose a new noncoherent rate-splitting scheme. We also consider treating interference-as-noise (TIN) scheme and a time division multiplexing (TDM) scheme. We observe that a standard training-based scheme for IC is outperformed by one of these schemes in several regimes: our results demonstrate that for low average interference-to-noise ratio (INR), TIN is best; for high INR, TDM and the noncoherent rate-splitting give better performance. We also study the noncoherent IC with feedback and propose a noncoherent rate-splitting scheme. Again for the feedback case as well, our results demonstrate that a natural training-based scheme can be outperformed by other schemes.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. Hachem;  U. Niesen;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1808.00653\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018', 'https://arxiv.org/abs/1808.00653', event);\">\n    Energy-Efficiency Gains of Caching for Interference Channels.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Communications Letters</i>, 22(7): 1434-1437. July 2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1808.00653\"\n     onclick=\"log_download('hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018', 'https://arxiv.org/abs/1808.00653', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Energy-Efficiency Gains of Caching for Interference Channels [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/LCOMM.2018.2822694\"\n     onclick=\"log_download('hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018', 'http://doi.org/10.1109/LCOMM.2018.2822694', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hachem-niesen-diggavi-energyefficiencygainsofcachingforinterferencechannels-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{8335768,\n abstract = {This letter initiates the study of energy-efficiency gains provided by caching. We focus on the cache-aided Gaussian interference channel in the low-SNR regime. We propose a strategy that creates content overlaps at the transmitter caches to allow for co-operation between the transmitters. This co-operation yields a beamforming gain, which has to be traded off against a multicasting gain. We evaluate the performance of this strategy and show its approximate optimality in both the single-receiver case and the single-transmitter case.},\n author = {J. {Hachem} and U. {Niesen} and S. {Diggavi}},\n doi = {10.1109/LCOMM.2018.2822694},\n issn = {1558-2558},\n journal = {IEEE Communications Letters},\n keywords = {array signal processing;cache storage;channel capacity;energy conservation;Gaussian channels;multicast communication;radio networks;radiofrequency interference;telecommunication power management;wireless channels;energy-efficiency gains;cache-aided Gaussian interference channel;low-SNR regime;transmitter caches;co-operation yields;beamforming gain;multicasting gain;Transmitters;Receivers;Multicast communication;Array signal processing;Libraries;Interference channels;Network coding;wireless networks;content distribution networks},\n month = {July},\n number = {7},\n pages = {1434-1437},\n tags = {journal,CCWN,IT,ANIT,WiNetnew,SCS},\n title = {Energy-Efficiency Gains of Caching for Interference Channels},\n type = {2},\n url_arxiv = {https://arxiv.org/abs/1808.00653},\n volume = {22},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This letter initiates the study of energy-efficiency gains provided by caching. We focus on the cache-aided Gaussian interference channel in the low-SNR regime. We propose a strategy that creates content overlaps at the transmitter caches to allow for co-operation between the transmitters. This co-operation yields a beamforming gain, which has to be traded off against a multicasting gain. We evaluate the performance of this strategy and show its approximate optimality in both the single-receiver case and the single-transmitter case.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sebastian-karakus-diggavi-approximatecapacityoffastfadinginterferencechannelswithnoinstantaneouscsit-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   J. Sebastian;  C. Karakus;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1706.03659\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sebastian-karakus-diggavi-approximatecapacityoffastfadinginterferencechannelswithnoinstantaneouscsit-2018', 'https://arxiv.org/abs/1706.03659', event);\">\n    Approximate Capacity of Fast Fading Interference Channels With no Instantaneous CSIT.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Communications</i>, 66(12): 6015-6027. Dec 2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1706.03659\"\n     onclick=\"log_download('sebastian-karakus-diggavi-approximatecapacityoffastfadinginterferencechannelswithnoinstantaneouscsit-2018', 'https://arxiv.org/abs/1706.03659', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Approximate Capacity of Fast Fading Interference Channels With no Instantaneous CSIT [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TCOMM.2018.2864266\"\n     onclick=\"log_download('sebastian-karakus-diggavi-approximatecapacityoffastfadinginterferencechannelswithnoinstantaneouscsit-2018', 'http://doi.org/10.1109/TCOMM.2018.2864266', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sebastian-karakus-diggavi-approximatecapacityoffastfadinginterferencechannelswithnoinstantaneouscsit-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sebastian-karakus-diggavi-approximatecapacityoffastfadinginterferencechannelswithnoinstantaneouscsit-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{8429509,\n abstract = {We develop a characterization of fading models, which assigns a number called logarithmic Jensen&#x27;s gap to a given fading model. We show that as a consequence of a finite logarithmic Jensen&#x27;s gap, an approximate capacity region can be obtained for fast fading interference channels (FF-ICs) for several scenarios. We illustrate three instances where a constant capacity gap can be obtained as a function of the logarithmic Jensen&#x27;s gap. First, for an FF-IC with neither feedback nor instantaneous channel state information at transmitter (CSIT), if the fading distribution has finite logarithmic Jensen&#x27;s gap, we show that a rate-splitting scheme based on the average interference-to-noise ratio can achieve its approximate capacity. Second, we show that a similar scheme can achieve the approximate capacity of FF-IC with feedback and delayed CSIT, if the fading distribution has finite logarithmic Jensen&#x27;s gap. Third, when this condition holds, we show that point-to-point codes can achieve approximate capacity for a class of FF-ICs with feedback. We prove that the logarithmic Jensen&#x27;s gap is finite for common fading models, including Rayleigh and Nakagami fading, thereby obtaining the approximate capacity region of FF-IC with these fading models.},\n author = {J. {Sebastian} and C. {Karakus} and S. {Diggavi}},\n doi = {10.1109/TCOMM.2018.2864266},\n issn = {1558-0857},\n journal = {IEEE Transactions on Communications},\n keywords = {approximation theory;channel capacity;diversity reception;fading channels;Gaussian channels;MIMO communication;Nakagami channels;radio transmitters;radiofrequency interference;Rayleigh channels;fast fading interference channels;finite logarithmic Jensen&#x27;s gap;approximate capacity region;FF-IC;constant capacity gap;instantaneous channel state information;fading distribution;common fading models;Rayleigh channels;Receivers;Transmitters;Integrated circuit modeling;Interference;Interference channels;fast fading;capacity region;rate-splitting},\n month = {Dec},\n number = {12},\n pages = {6015-6027},\n tags = {journal,ANIT,WiNetnew,NCWN,WNIF},\n title = {Approximate Capacity of Fast Fading Interference Channels With no Instantaneous CSIT},\n type = {2},\n url_arxiv = {https://arxiv.org/abs/1706.03659},\n volume = {66},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We develop a characterization of fading models, which assigns a number called logarithmic Jensen's gap to a given fading model. We show that as a consequence of a finite logarithmic Jensen's gap, an approximate capacity region can be obtained for fast fading interference channels (FF-ICs) for several scenarios. We illustrate three instances where a constant capacity gap can be obtained as a function of the logarithmic Jensen's gap. First, for an FF-IC with neither feedback nor instantaneous channel state information at transmitter (CSIT), if the fading distribution has finite logarithmic Jensen's gap, we show that a rate-splitting scheme based on the average interference-to-noise ratio can achieve its approximate capacity. Second, we show that a similar scheme can achieve the approximate capacity of FF-IC with feedback and delayed CSIT, if the fading distribution has finite logarithmic Jensen's gap. Third, when this condition holds, we show that point-to-point codes can achieve approximate capacity for a class of FF-ICs with feedback. We prove that the logarithmic Jensen's gap is finite for common fading models, including Rayleigh and Nakagami fading, thereby obtaining the approximate capacity region of FF-IC with these fading models.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   Jad Hachem;  Urs Niesen;  and  Suhas N Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1606.03175\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018', 'https://arxiv.org/abs/1606.03175', event);\">\n    Degrees of freedom of cache-aided wireless interference networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 64(7): 5359–5380.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1606.03175\"\n     onclick=\"log_download('hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018', 'https://arxiv.org/abs/1606.03175', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Degrees of freedom of cache-aided wireless interference networks [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2018.2825321\"\n     onclick=\"log_download('hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018', 'http://doi.org/10.1109/TIT.2018.2825321', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hachem-niesen-diggavi-degreesoffreedomofcacheaidedwirelessinterferencenetworks-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hachem2018degrees,\n abstract = {We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system&#x27;s degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.},\n author = {Hachem, Jad and Niesen, Urs and Diggavi, Suhas N},\n journal = {IEEE Transactions on Information Theory},\n number = {7},\n pages = {5359--5380},\n publisher = {IEEE},\n tags = {journal,CCWN,IT,WiNetnew,SCS,ANIT},\n title = {Degrees of freedom of cache-aided wireless interference networks},\n type = {2},\n url_arxiv = {https://arxiv.org/abs/1606.03175},\n doi = {10.1109/TIT.2018.2825321},\n volume = {64},\n year = {2018}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system's degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"mishra-wang-diggavi-harnessingburstyinterferenceinmulticarriersystemswithoutputfeedback-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mishra;  I. Wang;  and  S. N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Harnessing Bursty Interference in Multicarrier Systems With Output Feedback.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 63(7): 4430-4452. July 2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2017.2697866\"\n     onclick=\"log_download('mishra-wang-diggavi-harnessingburstyinterferenceinmulticarriersystemswithoutputfeedback-2017', 'http://doi.org/10.1109/TIT.2017.2697866', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mishra-wang-diggavi-harnessingburstyinterferenceinmulticarriersystemswithoutputfeedback-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mishra-wang-diggavi-harnessingburstyinterferenceinmulticarriersystemswithoutputfeedback-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{7911284,\n abstract = {We study parallel two-user interference channels when the interference is bursty and feedback is available from the respective receivers. Presence of interference in each subcarrier is modeled as a memoryless Bernoulli random state. The states across subcarriers are drawn from an arbitrary joint distribution with the same marginal probability for each subcarrier and instantiated independent and identically distributed (i.i.d.) over time. For the linear deterministic setup with symmetric interference in each subcarrier, we give a complete characterization of the capacity region. For the analogous setup with Gaussian noise, we give outer bounds and a tight generalized degrees of freedom characterization. We propose a novel helping mechanism, which enables subcarriers in very strong interference regime to help in recovering interfered signals for subcarriers in strong and weak interference regimes. Depending on the interference and burstiness regime, the inner bounds either employ the proposed helping mechanism to code across subcarriers or treat the subcarriers separately. The outer bounds demonstrate a connection to a subset entropy inequality by Madiman and Tetali.},\n author = {S. {Mishra} and I. {Wang} and S. N. {Diggavi}},\n doi = {10.1109/TIT.2017.2697866},\n issn = {1557-9654},\n journal = {IEEE Transactions on Information Theory},\n keywords = {Gaussian noise;probability;radio networks;radiofrequency interference;harnessing bursty interference;multicarrier systems;output feedback;interference channels;respective receivers;memoryless Bernoulli random state;arbitrary joint distribution;probability;symmetric interference;capacity region;Gaussian noise;subset entropy inequality;wireless networks;Receivers;Interference channels;Output feedback;Encoding;Channel models;Niobium;Interference channel;bursty interference;feedback;multicarrier systems},\n month = {July},\n number = {7},\n pages = {4430-4452},\n tags = {journal,IT,ANIT,WNIF},\n title = {Harnessing Bursty Interference in Multicarrier Systems With Output Feedback},\n type = {2},\n volume = {63},\n year = {2017}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study parallel two-user interference channels when the interference is bursty and feedback is available from the respective receivers. Presence of interference in each subcarrier is modeled as a memoryless Bernoulli random state. The states across subcarriers are drawn from an arbitrary joint distribution with the same marginal probability for each subcarrier and instantiated independent and identically distributed (i.i.d.) over time. For the linear deterministic setup with symmetric interference in each subcarrier, we give a complete characterization of the capacity region. For the analogous setup with Gaussian noise, we give outer bounds and a tight generalized degrees of freedom characterization. We propose a novel helping mechanism, which enables subcarriers in very strong interference regime to help in recovering interfered signals for subcarriers in strong and weak interference regimes. Depending on the interference and burstiness regime, the inner bounds either employ the proposed helping mechanism to code across subcarriers or treat the subcarriers separately. The outer bounds demonstrate a connection to a subset entropy inequality by Madiman and Tetali.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_5\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_5')\"\n      onkeypress=\"toggleGroup('group_5')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>5</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"avestimehr-diggavi-tian-tse-anapproximationapproachtonetworkinformationtheory-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A Salman Avestimehr;  Suhas N Diggavi;  Chao Tian;  and  David NC Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An approximation approach to network information theory.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Foundations and Trends in Communications and Information Theory</i>, 12(1-2): 1–183.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/avestimehr-diggavi-tian-tse-anapproximationapproachtonetworkinformationtheory-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('avestimehr-diggavi-tian-tse-anapproximationapproachtonetworkinformationtheory-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{avestimehr2015approximation,\n author = {Avestimehr, A Salman and Diggavi, Suhas N and Tian, Chao and Tse, David NC},\n journal = {Foundations and Trends in Communications and Information Theory},\n number = {1-2},\n pages = {1--183},\n publisher = {Now Publishers Inc. Hanover, MA, USA},\n tags = {monograph,ANIT},\n title = {An approximation approach to network information theory},\n type = {5},\n volume = {12},\n year = {2015}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2013\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2013')\"\n      onkeypress=\"toggleGroup('group_2013')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2013</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   U. Niesen;  and  S.N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1008.3813\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2013', 'http://arxiv.org/abs/1008.3813', event);\">\n    The Approximate Capacity of the Gaussian n-Relay Diamond Network.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Information Theory, IEEE Transactions on</i>, 59(2): 845-859. Feb 2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1008.3813\"\n     onclick=\"log_download('niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2013', 'http://arxiv.org/abs/1008.3813', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Approximate Capacity of the Gaussian n-Relay Diamond Network [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2012.2219154\"\n     onclick=\"log_download('niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2013', 'http://doi.org/10.1109/TIT.2012.2219154', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{6304926,\n abstract = {We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as in the high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound. We also present approximation results for the asymmetric Gaussian N-relay diamond network. In particular, we show that bursty amplify-and-forward combined with optimal relay selection achieves a rate within a factor O(log4(N)) of capacity with preconstant in the order notation independent of the channel gains.},\n author = {Niesen, U. and Diggavi, S.N.},\n doi = {10.1109/TIT.2012.2219154},\n issn = {0018-9448},\n journal = {Information Theory, IEEE Transactions on},\n month = {Feb},\n number = {2},\n pages = {845-859},\n tags = {journal,WiNet,IT,approxIT},\n title = {The Approximate Capacity of the Gaussian n-Relay Diamond Network},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/1008.3813},\n volume = {59},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as in the high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound. We also present approximation results for the asymmetric Gaussian N-relay diamond network. In particular, we show that bursty amplify-and-forward combined with optimal relay selection achieves a rate within a factor O(log4(N)) of capacity with preconstant in the order notation independent of the channel gains.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticebasedqmfcodes-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A Ozgur;  and  S.N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Information Theory, IEEE Transactions on</i>, 59(12): 8275-8294. Dec 2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2013.2280167\"\n     onclick=\"log_download('ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticebasedqmfcodes-2013', 'http://doi.org/10.1109/TIT.2013.2280167', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticebasedqmfcodes-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticebasedqmfcodes-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{6587830,\n abstract = {Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been demonstrated to approximately achieve (within an additive constant number of bits) the Gaussian relay network capacity, universally, i.e., for arbitrary topologies, channel gains, and SNRs. This was established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we develop structured lattice codes that implement the QMF strategy. The main result of this paper is that such structured lattice codes can approximately achieve the Gaussian relay network capacity universally, again within an additive constant. In addition, we establish a similar result for half-duplex networks, where we demonstrate that one can approximately achieve the capacity using fixed transmit-receive (TX-RX) schedules for the relays with no transmit power optimization across the different TX-RX states of the network.},\n author = {Ozgur, A and Diggavi, S.N.},\n doi = {10.1109/TIT.2013.2280167},\n file = {:papers:lattice_qmf.pdf},\n issn = {0018-9448},\n journal = {Information Theory, IEEE Transactions on},\n month = {Dec},\n number = {12},\n pages = {8275-8294},\n tags = {journal,approxIT,WiNet,IT,WiNetInfFlow},\n title = {Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes},\n type = {2},\n volume = {59},\n year = {2013}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been demonstrated to approximately achieve (within an additive constant number of bits) the Gaussian relay network capacity, universally, i.e., for arbitrary topologies, channel gains, and SNRs. This was established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we develop structured lattice codes that implement the QMF strategy. The main result of this paper is that such structured lattice codes can approximately achieve the Gaussian relay network capacity universally, again within an additive constant. In addition, we establish a similar result for half-duplex networks, where we demonstrate that one can approximately achieve the capacity using fixed transmit-receive (TX-RX) schedules for the relays with no transmit power optimization across the different TX-RX states of the network.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2011\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2011')\"\n      onkeypress=\"toggleGroup('group_2011')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2011</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"avestimehr-diggavi-tse-wirelessnetworkinformationflowadeterministicapproach-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Avestimehr;  S N. Diggavi;  and  D N C. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/0906.5394\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'avestimehr-diggavi-tse-wirelessnetworkinformationflowadeterministicapproach-2011', 'http://arxiv.org/abs/0906.5394', event);\">\n    Wireless network information flow: a deterministic approach.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 57(4). April 2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/0906.5394\"\n     onclick=\"log_download('avestimehr-diggavi-tse-wirelessnetworkinformationflowadeterministicapproach-2011', 'http://arxiv.org/abs/0906.5394', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Wireless network information flow: a deterministic approach [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/avestimehr-diggavi-tse-wirelessnetworkinformationflowadeterministicapproach-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('avestimehr-diggavi-tse-wirelessnetworkinformationflowadeterministicapproach-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ADTj10,\n abstract = {This paper approximately resolves the information flow over wireless (Gaussian) relay networks to within a constant number of bits. It introduced the linear deterministic model and established a max-flow min-cut result for linear deterministic networks. The insights from the deterministic approach led to the approximate max-flow min-cut characterization for noisy Gaussian networks, through the introduction of a new relaying\nstrategy called {\\em quantize-map-forward} (QMF).},\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\n file = {:papers:wirelessnetinfflow.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {adtj10},\n month = {April},\n note = {},\n number = {4},\n pages = {},\n tags = {journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\n title = {Wireless network information flow: a deterministic approach},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0906.5394},\n volume = {57},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper approximately resolves the information flow over wireless (Gaussian) relay networks to within a constant number of bits. It introduced the linear deterministic model and established a max-flow min-cut result for linear deterministic networks. The insights from the deterministic approach led to the approximate max-flow min-cut characterization for noisy Gaussian networks, through the introduction of a new relaying strategy called \\em quantize-map-forward (QMF).\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mohajer-diggavi-fragouli-tse-approximatecapacityregionforaclassofrelayinterferencenetworks-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  S N. Diggavi;  C. Fragouli;  and  D. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1005.0404\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'mohajer-diggavi-fragouli-tse-approximatecapacityregionforaclassofrelayinterferencenetworks-2011', 'http://arxiv.org/abs/1005.0404', event);\">\n    Approximate capacity region for a class of relay-interference networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 57(5): 2837-2864. May 2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1005.0404\"\n     onclick=\"log_download('mohajer-diggavi-fragouli-tse-approximatecapacityregionforaclassofrelayinterferencenetworks-2011', 'http://arxiv.org/abs/1005.0404', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Approximate capacity region for a class of relay-interference networks [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-diggavi-fragouli-tse-approximatecapacityregionforaclassofrelayinterferencenetworks-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-diggavi-fragouli-tse-approximatecapacityregionforaclassofrelayinterferencenetworks-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{MDFTj10,\n abstract = {In this paper we study  two-stage Gaussian \nrelay-interference networks where there are weak cross-links, causing the networks to behave like a chain\nof Z Gaussian channels. Our main result is an approximate characterization of the capacity region for  such networks. We propose a new interference management scheme, termed interference\nneutralization, which is implemented using structured lattice codes. This scheme allows for over-the-air\ninterference removal, without the transmitters having complete access the interfering signals.},\n author = {S. Mohajer and S N. Diggavi and C. Fragouli and D. Tse},\n file = {:papers:relayinterference_revised.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {mdft_js10},\n month = {May},\n note = {},\n number = {5},\n pages = {2837-2864},\n tags = {journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt,LatticeChan},\n title = {Approximate capacity region for a class of relay-interference networks},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/1005.0404},\n volume = {57},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we study two-stage Gaussian relay-interference networks where there are weak cross-links, causing the networks to behave like a chain of Z Gaussian channels. Our main result is an approximate characterization of the capacity region for such networks. We propose a new interference management scheme, termed interference neutralization, which is implemented using structured lattice codes. This scheme allows for over-the-air interference removal, without the transmitters having complete access the interfering signals.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   U. Niesen;  and  S. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  The approximate capacity of the Gaussian N-relay diamond network.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on</i>, pages 259-263, July 2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ISIT.2011.6034040\"\n     onclick=\"log_download('niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2011', 'http://doi.org/10.1109/ISIT.2011.6034040', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('niesen-diggavi-theapproximatecapacityofthegaussiannrelaydiamondnetwork-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{6034040,\n abstract = {We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains, and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound.},\n author = {Niesen, U. and Diggavi, S.},\n booktitle = {Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on},\n doi = {10.1109/ISIT.2011.6034040},\n file = {:papers:nrelay_diamond_isit.pdf},\n issn = {2157-8095},\n month = {July},\n pages = {259-263},\n tags = {conf,approxIT,IT,WiNet},\n title = {The approximate capacity of the Gaussian N-relay diamond network},\n type = {4},\n year = {2011}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains, and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2010\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2010')\"\n      onkeypress=\"toggleGroup('group_2010')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2010</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"mohajer-tian-diggavi-onsourcetransmissionoverdeterministicrelaynetworks-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  C. Tian;  and  S.N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On source transmission over deterministic relay networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW) Cairo</i>, January 2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-tian-diggavi-onsourcetransmissionoverdeterministicrelaynetworks-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-tian-diggavi-onsourcetransmissionoverdeterministicrelaynetworks-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{MTDp10,\n abstract = {Lossless transmission of a set of correlated sources\nover a deterministic relay network is considered for two traffic\nrequirements. In distributed multicast, the set of sources are\nto be delivered to a set of destinations. The source exchange\nrequires all the nodes with access to sources to be able to\nreconstruct all other sources observed at other nodes. We develop\nachievable regions and outer bounds for both these situations. For\nlinear deterministic networks, these bounds coincide, yielding a\ncharacterization.},\n author = {S. Mohajer and C. Tian and S.N. Diggavi},\n booktitle = {IEEE Information Theory Workshop (ITW) Cairo},\n file = {:papers:mtd_itw10_final.pdf},\n month = {January},\n note = {},\n pages = {},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SrcChan,SrcChanSep,NDC,InfExch,SelConf},\n title = {On source transmission over deterministic relay networks},\n type = {4},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Lossless transmission of a set of correlated sources over a deterministic relay network is considered for two traffic requirements. In distributed multicast, the set of sources are to be delivered to a set of destinations. The source exchange requires all the nodes with access to sources to be able to reconstruct all other sources observed at other nodes. We develop achievable regions and outer bounds for both these situations. For linear deterministic networks, these bounds coincide, yielding a characterization.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticecodes-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   A. Ozgur;  and  S N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1005.1284\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticecodes-2010', 'http://arxiv.org/abs/1005.1284', event);\">\n    Approximately achieving Gaussian relay network capacity with lattice codes.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proc. of IEEE ISIT 2010, Austin, Texas</i>, pages 669–673, June 2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1005.1284\"\n     onclick=\"log_download('ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticecodes-2010', 'http://arxiv.org/abs/1005.1284', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Approximately achieving Gaussian relay network capacity with lattice codes [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticecodes-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticecodes-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ODp10,\n abstract = {An approximate max-flow min-cut result for arbitrary wireless relay\nnetwork was recently established using Gaussian codebooks for\ntransmission and random mappings at the relays. In this paper,\nwe show that the approximation result can be established\nby using lattices for transmission and quantization along with\nstructured mappings at the relays. This also extended the original scalar quantizer\nanalysis to vector quantizers and obtained a slightly better approximation constant.},\n author = {A. Ozgur and S N. Diggavi},\n booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},\n file = {:papers:od_isit10.pdf},\n month = {June},\n note = {},\n pages = {669--673},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SelConf,LatticeChan},\n title = {Approximately achieving Gaussian relay network capacity with lattice codes},\n type = {4},\n url_arxiv = {http://arxiv.org/abs/1005.1284},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  An approximate max-flow min-cut result for arbitrary wireless relay network was recently established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we show that the approximation result can be established by using lattices for transmission and quantization along with structured mappings at the relays. This also extended the original scalar quantizer analysis to vector quantizers and obtained a slightly better approximation constant.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  J. Chen;  S N. Diggavi;  and  S. Shamai.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Optimality and approximate optimality of source-channel separation in networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proc. of IEEE ISIT 2010, Austin, Texas</i>, pages 495–499, June 2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-chen-diggavi-shamai-optimalityandapproximateoptimalityofsourcechannelseparationinnetworks-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{TCDSc10a,\n author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},\n booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},\n month = {June},\n note = {},\n pages = {495--499},\n tags = {conf,SrcChan,ITapprox,NDC,IT},\n title = {Optimality and approximate optimality of source-channel \nseparation in networks},\n type = {4},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"tian-chen-diggavi-shamai-onsourcechannelseparationinnetworks-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  J. Chen;  S N. Diggavi;  and  S. Shamai.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On source-channel separation in networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>International Conference on Signal Processing and Communications (SPCOM)</i>, pages 1–5, June 2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-chen-diggavi-shamai-onsourcechannelseparationinnetworks-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-chen-diggavi-shamai-onsourcechannelseparationinnetworks-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{TCDSc10b,\n abstract = {We consider the source-channel separation architecture\nfor lossy source coding in communication networks. It\nis shown that the separation approach is optimal when the\nmemoryless sources at source nodes are arbitrarily correlated,\neach of which is to be reconstructed at possibly multiple\ndestinations within certain distortions, and the channels in this\nnetwork are synchronized, orthogonal and memoryless (i.e., noisy\ngraphs).},\n author = {C. Tian and  J. Chen and S N. Diggavi and S. Shamai},\n booktitle = {International Conference on Signal Processing and Communications (SPCOM)},\n file = {:papers:tcdsspcom10.pdf},\n month = {June},\n note = {},\n pages = {1--5},\n tags = {conf,SrcChan,ITapprox,NDC,IT,SelConf},\n title = {On source-channel separation in networks},\n type = {4},\n year = {2010}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal when the memoryless sources at source nodes are arbitrarily correlated, each of which is to be reconstructed at possibly multiple destinations within certain distortions, and the channels in this network are synchronized, orthogonal and memoryless (i.e., noisy graphs).\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2009\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2009')\"\n      onkeypress=\"toggleGroup('group_2009')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2009</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"mohajer-diggavi-fragouli-tse-capacityofdeterministiczchainrelayinterferencenetwork-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  S N. Diggavi;  C. Fragouli;  and  D. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Capacity of Deterministic Z-Chain Relay-Interference Network.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW), Volos, Greece</i>, pages 331–335, June 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-diggavi-fragouli-tse-capacityofdeterministiczchainrelayinterferencenetwork-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-diggavi-fragouli-tse-capacityofdeterministiczchainrelayinterferencenetwork-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{MDFSj09,\n author = {S. Mohajer and S N. Diggavi and C. Fragouli and D. Tse},\n booktitle = {IEEE Information Theory Workshop (ITW), Volos, Greece},\n month = {June},\n note = {},\n pages = {331--335},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt},\n title = {Capacity of Deterministic Z-Chain Relay-Interference Network},\n type = {4},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mohajer-diggavi-tse-approximatecapacityofaclassofgaussianrelayinterferencenetworks-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  S N. Diggavi;  and  D. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Approximate Capacity of a Class of Gaussian Relay-Interference Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT), Seoul, Korea</i>, pages 31–35, June 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-diggavi-tse-approximatecapacityofaclassofgaussianrelayinterferencenetworks-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-diggavi-tse-approximatecapacityofaclassofgaussianrelayinterferencenetworks-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{MDTj09,\n author = {S. Mohajer and S N. Diggavi and D. Tse},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Seoul, Korea},\n month = {June},\n note = {},\n pages = {31--35},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt,LatticeChan},\n title = {Approximate Capacity of a Class of Gaussian Relay-Interference Networks},\n type = {4},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"perron-diggavi-etelatar-onnoiseinsertionstrategiesforwirelessnetworksecrecy-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   E. Perron;  S N. Diggavi;  and   E. Telatar.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On noise insertion strategies for wireless network secrecy.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Information Theory and Applications workshop (ITA), UCSD, San Diego, California</i>, pages 77–84, February 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/perron-diggavi-etelatar-onnoiseinsertionstrategiesforwirelessnetworksecrecy-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('perron-diggavi-etelatar-onnoiseinsertionstrategiesforwirelessnetworksecrecy-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{PDTc09d,\n abstract = {This paper studies the idea of noise insertion by authenticated relays through friendly jamming. We develop the secrecy rate achievable in arbitrary (deterministic) networks when there are relays actively helping secrecy.},\n author = {E. Perron and S N. Diggavi and E. Telatar,},\n booktitle = {Information Theory and Applications workshop (ITA), UCSD, San Diego, California},\n file = {:papers:pdtita09final.pdf},\n label = {pdtc09d},\n month = {February},\n note = {},\n pages = {77--84},\n tags = {conf,ITsecrecy,IT,WiNetSec,WiNetInfFlow,ITapprox,WiNet},\n title = {On noise insertion strategies for wireless network secrecy},\n type = {4},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper studies the idea of noise insertion by authenticated relays through friendly jamming. We develop the secrecy rate achievable in arbitrary (deterministic) networks when there are relays actively helping secrecy.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"perron-diggavi-telatar-ontheinterferencemultipleaccesschannel-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   E. Perron;  S N. Diggavi;  and  E. Telatar.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On the interference-multiple-access channel.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Conference on Communications (ICC), Dresden, Germany</i>, pages 31–35, June 2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/perron-diggavi-telatar-ontheinterferencemultipleaccesschannel-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('perron-diggavi-telatar-ontheinterferencemultipleaccesschannel-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{PDTj09c,\n abstract = {We introduce the interference-multiple-access channel,\nwhich is a discrete memoryless channel with two transmitters\nand two receivers, similar to the interference channel. One\nreceiver is required to decode the information encoded at one\ntransmitter, the other receiver is required to decode the messages\nfrom both transmitters. We provide an inner bound on the\ncapacity region of this channel, as well as an outer bound for a\nspecial class of such channels. For this class, we also quantify the\ngap between inner and outer bound and show that the bounds\nmatch for a semi-deterministic channel, providing a complete\ncharacterization. For the Gaussian case, we show that the gap is\nat most 1 bit, yielding an approximate characterization.},\n author = {E. Perron and S N. Diggavi and E. Telatar},\n booktitle = {IEEE International Conference on Communications (ICC), Dresden, Germany},\n file = {:papers:pdt_icc09.pdf},\n month = {June},\n note = {},\n pages = {31--35},\n tags = {conf,ITapprox,WiNet,IT,WiNetInfFlow,IntChan,SelConf},\n title = {On the interference-multiple-access channel},\n type = {4},\n year = {2009}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the other receiver is required to decode the messages from both transmitters. We provide an inner bound on the capacity region of this channel, as well as an outer bound for a special class of such channels. For this class, we also quantify the gap between inner and outer bound and show that the bounds match for a semi-deterministic channel, providing a complete characterization. For the Gaussian case, we show that the gap is at most 1 bit, yielding an approximate characterization.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2008\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2008')\"\n      onkeypress=\"toggleGroup('group_2008')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2008</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"avestimehr-diggavi-dnctse-approximatecharacterizationofcapacityingaussianrelaynetworks-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Avestimehr;  S N. Diggavi;  and   D N C. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Approximate characterization of capacity in Gaussian relay networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Wireless Communications and Mobile Computing Conference (IWCMC), Crete, Greece</i>, pages 56–61, August 2008. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/avestimehr-diggavi-dnctse-approximatecharacterizationofcapacityingaussianrelaynetworks-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('avestimehr-diggavi-dnctse-approximatecharacterizationofcapacityingaussianrelaynetworks-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ADTj08a,\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse, },\n booktitle = {IEEE International Wireless Communications and Mobile Computing Conference (IWCMC), Crete, Greece},\n month = {August},\n note = {},\n pages = {56--61},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\n title = {Approximate characterization of capacity in Gaussian relay networks},\n type = {4},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"avestimehr-diggavi-tse-approximatecapacityofgaussianrelaynetworks-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Avestimehr;  S N. Diggavi;  and  D N C. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Approximate Capacity of Gaussian Relay Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE International Symposium on Information Theory (ISIT), Toronto, Canada</i>, pages 474–478, July 2008. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/avestimehr-diggavi-tse-approximatecapacityofgaussianrelaynetworks-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('avestimehr-diggavi-tse-approximatecapacityofgaussianrelaynetworks-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ADTj08b,\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Toronto, Canada},\n month = {July},\n note = {},\n pages = {474--478},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\n title = {Approximate Capacity of Gaussian Relay Networks},\n type = {4},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"avestimehr-diggavi-tse-informationflowovercompoundwirelessrelaynetworks-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Avestimehr;  S N. Diggavi;  and  D N C. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Information flow over compound wireless relay networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Zurich Seminar on Communications (IZS), Zurich, Switzerland</i>, pages 92, March 2008. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/avestimehr-diggavi-tse-informationflowovercompoundwirelessrelaynetworks-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('avestimehr-diggavi-tse-informationflowovercompoundwirelessrelaynetworks-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ADTj08c,\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\n booktitle = {IEEE Zurich Seminar on Communications (IZS), Zurich, Switzerland},\n month = {March},\n note = {},\n pages = {92},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\n title = {Information flow over compound wireless relay networks},\n type = {4},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mohajer-diggavi-fragouli-tse-transmissiontechniquesforrelayinterferencenetworks-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Mohajer;  S N. Diggavi;  C. Fragouli;  and  D. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Transmission techniques for relay-interference networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois</i>, pages 464–474, September 2008. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mohajer-diggavi-fragouli-tse-transmissiontechniquesforrelayinterferencenetworks-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mohajer-diggavi-fragouli-tse-transmissiontechniquesforrelayinterferencenetworks-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{MDFTj08,\n author = {S. Mohajer and S N. Diggavi and C. Fragouli and D. Tse},\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\n month = {September},\n note = {},\n pages = {464--474},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt},\n title = {Transmission techniques for relay-interference networks},\n type = {4},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2007\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2007')\"\n      onkeypress=\"toggleGroup('group_2007')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2007</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"avestimehr-diggavi-tse-adeterministicmodelforwirelessrelaynetworksanditscapacity-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Avestimehr;  S N. Diggavi;  and  D N C. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A deterministic model for wireless relay networks and its capacity.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IEEE Information Theory Workshop (ITW) Bergen, Norway</i>, pages 6–11, July 2007. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/avestimehr-diggavi-tse-adeterministicmodelforwirelessrelaynetworksanditscapacity-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('avestimehr-diggavi-tse-adeterministicmodelforwirelessrelaynetworksanditscapacity-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ADTj07,\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\n booktitle = {IEEE Information Theory Workshop (ITW) Bergen, Norway},\n month = {July},\n note = {},\n pages = {6--11},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\n title = {A deterministic model for wireless relay networks and its capacity},\n type = {4},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"avestimehr-diggavi-tse-wirelessnetworkinformationflow-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Avestimehr;  S N. Diggavi;  and  D N C. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wireless network information flow.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois</i>, September 2007. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/avestimehr-diggavi-tse-wirelessnetworkinformationflow-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('avestimehr-diggavi-tse-wirelessnetworkinformationflow-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ADTj07a,\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\n label = {adt_allerton07a},\n month = {September},\n note = {},\n pages = {},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\n title = {Wireless network information flow},\n type = {4},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"avestimehr-diggavi-tse-adeterministicapproachtowirelessrelaynetworks-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S. Avestimehr;  S N. Diggavi;  and  D N C. Tse.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Deterministic Approach to Wireless Relay Networks.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois</i>, Sept 2007. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/avestimehr-diggavi-tse-adeterministicapproachtowirelessrelaynetworks-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('avestimehr-diggavi-tse-adeterministicapproachtowirelessrelaynetworks-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ADTj07b,\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\n booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois},\n label = {adt_allerton07b},\n month = {Sept},\n note = {},\n pages = {},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\n title = {A Deterministic Approach to Wireless Relay Networks},\n type = {4},\n year = {2007}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);